Filters








5,973 Hits in 9.4 sec

Compacting XML Structures Using a Dynamic Labeling Scheme [chapter]

Ramez Alkhatib, Marc H. Scholl
2009 Lecture Notes in Computer Science  
Our approach exploits repetitive consecutive subtrees and tags for compacting the structure of XML documents by taking advantage of the ORDPATH labeling scheme.  ...  On the other hand, with the verbosity and redundancy problem of XML, which can lead to increased cost for processing XML documents, compaction of XML documents has become an increasingly important research  ...  Also we use the ORDPATH labeling scheme [7] for gathering sufficient structural information from the compacted XML document.  ... 
doi:10.1007/978-3-642-02843-4_16 fatcat:jmt6h2whj5emnb4ra2im33c2lm

Fast and incremental indexing in effective and efficient XML element retrieval systems

Atsushi Keyaki, Jun Miyazaki, Kenji Hatano, Goshiro Yamamoto, Takafumi Taketomi, Hirokazu Kato
2012 Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services - IIWAS '12  
A method for fast and incremental indexing, with both effective and efficient query processing, is proposed for XML element retrieval.  ...  We construct indices for fast updating and propose a method for computing accurate term weights even under dynamically changing statistics.  ...  Term-weighting schemes for XML element retrieval are often derived from studies on document searches.  ... 
doi:10.1145/2428736.2428763 dblp:conf/iiwas/KeyakiMHYTK12 fatcat:p3jtp42eyfezpptkjhjou3ccre

Fast incremental indexing with effective and efficient searching in XML element retrieval

Atsushi Keyaki, Jun Miyazaki, Kenji Hatano, Goshiro Yamamoto, Takafumi Taketomi, Hirokazu Kato
2013 International Journal of Web Information Systems  
In this paper, we propose methods for fast incremental indexing with effective and efficient query processing in XML element retrieval.  ...  We therefore propose two methods: one to approximate term weights accurately with a small number of documents, even for dynamically changing statistics; and the other to eliminate unnecessary update targets  ...  A pair of start and end tags represents an XML element node within an XML tree, and the nested structure of XML elements rep-2 For a certain document set, the index size of the document retrieval system  ... 
doi:10.1108/ijwis-04-2013-0008 fatcat:xzjtmy5t7rfwjgpejdtkq2f5kq

A New Method of Generating Index Label for Dynamic XML Data

Paramasivam
2011 Journal of Computer Science  
Approach: Based on the structural indexing used the performance of the query processing system will be affected. The dynamic XML document allows inserting, deleting and updating operations.  ...  To avoid this problem, in the scheme New Labeling Scheme for XML (NLSX), only the small, capital letters and digits are used to generate persistent labels for the nodes in the document.  ...  The queries involved with structural pattern can be effectively processed by using the indexing scheme which uses persistent labels for the document nodes in the XML document.  ... 
doi:10.3844/jcssp.2011.421.426 fatcat:bjpy56c2tvdvlbg5myfbq7nswq

Efficient XML Retrieval Service with Complete Path Representation

Hsu-Kuang CHANG, King-Chu HUNG, I-Chang JOU
2013 IEICE transactions on information and systems  
CPR can completely preserve hierarchical information, and the new index is used to save semantic information. The CPR approach can provide template-based indexing for fast data searches.  ...  An experiment is also conducted for the evaluation of the CPR approach. key words: XML, DTD, complete path representation (CPR), structural summary tree (  ...  Structural Summary Tree Extraction of XML Documents SST is the XML tree skeleton commonly used for XML data representation [3] .  ... 
doi:10.1587/transinf.e96.d.906 fatcat:4z5r7exmk5foppnb4sehnelzny

Adaptive XML Storage or The Importance of Being Lazy

Cristian Duda, Donald Kossmann
2005 International Workshop on XQuery Implementation, Experience and Perspectives  
Building an XML store means finding solutions to the problems of representing, accessing, querying and updating XML data.  ...  This allows for automatic, application-specific tuning, facing the range of challenges imposed by the current XML applications.  ...  The necessity to assign identifiers to nodes in an XML document, brought a variety of identifier and indexing schemes for XML [16] , [9] , [17] Related to this approach are works which try to map the  ... 
dblp:conf/ximep/DudaK05 fatcat:6ibhpmzcebadxdetsdgb7nrs7q

Supporting complex queries on multiversion XML documents

Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo, Donghui Zhang
2006 ACM Transactions on Internet Technology  
Managing multiple versions of XML documents represents a critical requirement for many applications.  ...  Our approach relies on a numbering scheme whereby durable node numbers (DNNs) are used to preserve the order among the nodes of the XML tree while remaining invariant with respect to updates.  ...  Acknowledgments The authors would like to thank Bongki Moon for many useful discussions.  ... 
doi:10.1145/1125274.1125277 fatcat:n4ojkbtlfzfkhbwu5jlayrycm4

Updating the Pre/Post Plane in MonetDB/XQuery

Peter A. Boncz, Stefan Manegold, Jan Rittinger
2005 International Workshop on XQuery Implementation, Experience and Perspectives  
We outline an efficient ACID-compliant mechanism for structural inserts and deletes in relational XML document storage that uses a region based pre/size/level encoding (equivalent to the pre/post encoding  ...  Updates to such node-numbering schemes are considered prohibitive (i.e. physical cost linear to document size), because structural updates cause shifts in all pre-numbers after the update point, and require  ...  While an insert operation in such indexing schemes may be cheaper than our page-based mechanism, we lack an XML update benchmark to properly assess this.  ... 
dblp:conf/ximep/BonczMR05 fatcat:ie63f5notzhmhint3pybge6qem

Efficient Complex Query Support for Multiversion XML Documents [chapter]

Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo, Donghui Zhang
2002 Lecture Notes in Computer Science  
Managing multiple versions of XML documents represents a critical requirement for many applications.  ...  Our approach relies on a scheme based on durable node numbers (DNNs) that preserve the order among the XML tree nodes and are invariant with respect to updates.  ...  Acknowledgments The authors would like to thank Bongki Moon for many useful discussions.  ... 
doi:10.1007/3-540-45876-x_12 fatcat:gm7ynfpikbbnrd2riogxwoyapi

Querying and maintaining a compact XML storage

Raymond K. Wong, Franky Lam, William M. Shui
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance.  ...  This paper presents a new storage scheme for XML data that supports all navigational operations in near constant time.  ...  In Figure 3 , the topology layer stores the tree structure of the XML document, and facilitates fast navigational accesses, structural joins and updates.  ... 
doi:10.1145/1242572.1242717 dblp:conf/www/WongLS07 fatcat:mtzponk5zjfhjbbokrq74az2q4

Path-expression Queries over Multiversion XML Documents

Zografoula Vagena, Vassilis J. Tsotras
2003 International Workshop on the Web and Databases  
We first present an easily updatable numbering scheme that efficiently captures structural relationships among the elements of the dynamically evolving document.  ...  ., non-versioned) documents as path joins, using numbering schemes that maintain the structural relationships among the document elements.  ...  This is a novel problem since it requires easily updatable numbering schemes to capture the structural characteristics of an evolving document.  ... 
dblp:conf/webdb/VagenaT03 fatcat:f7b2uezqnrbqxkj7uxnibn4ptq

Efficient Compression and Querying of XML Repositories

Ramez Alkhatib, Marc H. Scholl
2008 2008 19th International Conference on Database and Expert Systems Applications  
In this paper, we propose a new approach called SCQX for Storing, Compressing and Querying XML documents.  ...  a robust storage structure that includes a set of access support structures to guarantee fast query performance.  ...  Related Work In recent years, several path indexing, labeling and numbering schemes have been proposed for query processing of XML documents.  ... 
doi:10.1109/dexa.2008.64 dblp:conf/dexaw/AlkhatibS08 fatcat:rbpkhoihb5eathkjhuug3sxp3y

Algorithms for Indexing Dynamic XML Data

Jeang-Kuo Chen, Jen-Peng Hsu
2006 Proceedings of the 9th Joint Conference on Information Sciences (JCIS)  
The method LSDX (Labeling Scheme for Dynamic XML data) can dynamically add new labels without updating existing old labels. However, there are two defects in LSDX.  ...  The indexes derived by these approaches must be rebuilt if XML data is updated.  ...  The algorithms for building and updating index tree The node structure of an XML index tree The node structure in an XML index tree is shown in Fig. 2 . Each node contains four fields.  ... 
doi:10.2991/jcis.2006.333 dblp:conf/jcis/ChenH06 fatcat:c4sd6yvvbzab5ir3rtijqdze2y

Approximate Query Answering and Result Refinement on XML Data [chapter]

Katja Seidler, Eric Peukert, Gregor Hackenbroich, Wolfgang Lehner
2010 Lecture Notes in Computer Science  
Today, many economic decisions are based on the fast analysis of XML data. Yet, the time to process analytical XML queries is typically high.  ...  In this paper, we introduce a system that provides fast estimates to XML aggregation queries. While processing, these estimates and the assigned confidence bounds are constantly improving.  ...  Index Traditional XML database systems utilize special numbering schemes to speed up query processing: They label all elements of an XML document and store these labels for each element into an index  ... 
doi:10.1007/978-3-642-13818-8_7 fatcat:5wmxeco7l5eizo46nyoedcavxy

Utilizing XML Clustering for Efficient XML Data Management on P2P Networks [chapter]

Panagiotis Antonellis, Christos Makris, Nikos Tsirakis
2009 Lecture Notes in Computer Science  
Some of the primary problems in this research area are the techniques to be used for querying, indexing and distributing documents among peers in a network especially when document files are in XML format  ...  The novelty of the proposed system lies in the efficient distribution of the XML documents and the construction of an appropriate virtual index on top of the network peers.  ...  Fig. 2 2 Utilized indexing scheme can be utilized for checking if a twig query exists in the underlying XML document.  ... 
doi:10.1007/978-3-642-03573-9_6 fatcat:5vyprs3rq5adpbxftzjbrmafd4
« Previous Showing results 1 — 15 out of 5,973 results