Filters








22,426 Hits in 5.1 sec

Covering indexes for branching path queries

Raghav Kaushik, Philip Bohannon, Jeffrey F Naughton, Henry F Korth
2002 Proceedings of the 2002 ACM SIGMOD international conference on Management of data - SIGMOD '02  
The resulting index structures are dramatically smaller and perform better than the full forward-and-backward index for these classes of branching path expressions.  ...  In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tree-or graph-structured  ...  at an index that is much smaller and can handle the remaining branching path expressions more efficiently.  ... 
doi:10.1145/564691.564707 dblp:conf/sigmod/KaushikBNK02 fatcat:cfla4lyxnzdd5jn4tm6idt7vpu

Covering indexes for branching path queries

Raghav Kaushik, Philip Bohannon, Jeffrey F Naughton, Henry F Korth
2002 Proceedings of the 2002 ACM SIGMOD international conference on Management of data - SIGMOD '02  
The resulting index structures are dramatically smaller and perform better than the full forward-and-backward index for these classes of branching path expressions.  ...  In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tree-or graph-structured  ...  at an index that is much smaller and can handle the remaining branching path expressions more efficiently.  ... 
doi:10.1145/564704.564707 fatcat:ory25a4kjnfsbgqu6wh6p3pjp4

ViST

Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
2003 Proceedings of the 2003 ACM SIGMOD international conference on on Management of data - SIGMOD '03  
In this paper, we propose ViST, a novel index structure for searching XML documents.  ...  With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents.  ...  Moreover, to retrieve semi-structured data efficiently, it is essential to have index on both structure and content of the XML data.  ... 
doi:10.1145/872773.872774 fatcat:2eoont637vgcvezsxrf5m6fxzm

ViST

Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
2003 Proceedings of the 2003 ACM SIGMOD international conference on on Management of data - SIGMOD '03  
In this paper, we propose ViST, a novel index structure for searching XML documents.  ...  With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents.  ...  Moreover, to retrieve semi-structured data efficiently, it is essential to have index on both structure and content of the XML data.  ... 
doi:10.1145/872757.872774 dblp:conf/sigmod/WangPFY03 fatcat:hzamxssz5bguna35q4tql7yzim

Index Structures for Matching XML Twigs Using Relational Query Processors

Zhiyuan Chen, J. Gehrke, F. Korn, N. Koudas, J. Shanmugasundaram, D. Srivastava
2005 21st International Conference on Data Engineering Workshops (ICDEW'05)  
We also propose two novel index structures in this family, with different space-time tradeoffs, that are effective for the evaluation of XML branching path expressions (i.e., twigs) with value conditions  ...  Various index structures have been proposed to speed up the evaluation of XML path expressions.  ...  aspects in isolation, we are not aware of any index structure that handles all of these issues within a unified framework (see Section 2 for more details).  ... 
doi:10.1109/icde.2005.231 dblp:conf/icde/ChenGK05a fatcat:bbvornl7oza6nll3raklpe7x7i

Index structures for matching XML twigs using relational query processors

Zhiyuan Chen, Johannes Gehrke, Flip Korn, Nick Koudas, Jayavel Shanmugasundaram, Divesh Srivastava
2007 Data & Knowledge Engineering  
We also propose two novel index structures in this family, with different space-time tradeoffs, that are effective for the evaluation of XML branching path expressions (i.e., twigs) with value conditions  ...  Various index structures have been proposed to speed up the evaluation of XML path expressions.  ...  aspects in isolation, we are not aware of any index structure that handles all of these issues within a unified framework (see Section 2 for more details).  ... 
doi:10.1016/j.datak.2006.03.003 fatcat:wtbf2xcvuffcln725m552hpwya

Ix-cubes

Fianny Ming-fei Jiang, Jian Pei, Ada Wai-chee Fu
2007 Proceedings of the sixteenth ACM conference on Conference on information and knowledge management - CIKM '07  
However, the evaluation of OLAP queries over XML data is not a trivial extension of the relational solutions, especially when a schema is not available.  ...  With increasing amount of data being stored in XML format, OLAP queries over these data become important. OLAP queries have been well studied in the relational database systems.  ...  Although the purpose of computing data cube over XML data is the same as that of relational data, the technique is quite different due to the difficulties in handling the semi-structure nature of XML data  ... 
doi:10.1145/1321440.1321572 dblp:conf/cikm/JiangPF07 fatcat:lk6avo6fmnhhnllr23curgr7fq

Structural summaries for efficient XML query processing

Sofía Brenes
2008 Proceedings of the 2008 EDBT Ph.D. workshop on - Ph.D. '08  
In particular, we study the roles various fragments of XPath algebra play in distinguishing data components in an XML document, and leverage the results in designing novel structural indexes and statistical  ...  summaries for more efficient XML query processing and more accurate result size estimation.  ...  The Forward and Backward-Index (F&B-Index) [16] groups nodes by considering both incoming and outgoing paths and is capable of handling queries with branches.  ... 
doi:10.1145/1387150.1387161 fatcat:ginep2f3ofhz3gxmasdrueouda

Implementing a scalable XML publish/subscribe system using relational database systems

Feng Tian, Berthold Reinwald, Hamid Pirahesh, Tobias Mayr, Jussi Myllymaki
2004 Proceedings of the 2004 ACM SIGMOD international conference on Management of data - SIGMOD '04  
The system shows very good performance and scalability in our experiments, handling millions of subscriptions with moderate amount of physical memory.  ...  The performance and scalability of the matching algorithm is essential for the system when the number of XPath subscriptions is large.  ...  ACKNOWLEDGEMENTS The authors would like to thank Marc Schunk for designing the test case for the simple flat XML data. David J.  ... 
doi:10.1145/1007568.1007623 dblp:conf/sigmod/TianDPRMM04 fatcat:sb25p6jmfvc4vnsbkskmrhy7pu

A Two-Step Approach For Tree-Structured Xpath Query Reduction

Minsoo Lee, Yun-Mi Kim, Yoon-Kyung Lee
2007 Zenodo  
XML data consists of a very flexible tree-structure which makes it difficult to support the storing and retrieving of XML data.  ...  This paper introduces mechanisms to reduce the XPath queries including branch nodes into a much more efficient form with less numbers of structural joins. A two step approach is proposed.  ...  [8] proposed query pruning and rewriting techniques for regular path expressions using graph schemas which represent partial knowledge about the structures of the semi-structured documents.  ... 
doi:10.5281/zenodo.1080107 fatcat:yqm6zmpe5bc7vg6kdsu3p7dhhy

Unleashing XQuery for Data-Independent Programming

Sebastian Bächle, Caetano Sauer
2014 Datenbank-Spektrum  
The XQuery language was initially developed as an SQL equivalent for XML data, but its roots in functional programming make it also a perfect choice for processing almost any kind of structured and semi-structured  ...  Expensive iterative sections in a query are unrolled to a pipeline of relational-style operators, which is open for optimized join processing, index use, and parallelization.  ...  This allows us to make use of the query compiler for process-ing any kind of structured or semi-structured data format such as JSON.  ... 
doi:10.1007/s13222-014-0160-3 fatcat:fovgm2e7zfdebjvh4euqapaoxy

P-tree

Adina Crainiceanu, Prakash Linga, Johannes Gehrke, Jayavel Shanmugasundaram
2004 Alternate track papers & posters of the 13th international conference on World Wide Web - WWW Alt. '04  
We propose a new distributed, fault-tolerant Peer-to-Peer index structure for resource discovery applications called the P-tree.  ...  P-trees efficiently support range queries in addition to equality queries.  ...  The key idea behind the P-tree is to maintain parts of semi-independent B+-trees at each peer. This allows for fully distributed index maintenance.  ... 
doi:10.1145/1010432.1010555 fatcat:w2m7l7upnvaqbgglsjmcilblie

P-tree

Adina Crainiceanu, Prakash Linga, Johannes Gehrke, Jayavel Shanmugasundaram
2004 Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters - WWW Alt. '04  
We propose a new distributed, fault-tolerant Peer-to-Peer index structure for resource discovery applications called the P-tree.  ...  P-trees efficiently support range queries in addition to equality queries.  ...  The key idea behind the P-tree is to maintain parts of semi-independent B+-trees at each peer. This allows for fully distributed index maintenance.  ... 
doi:10.1145/1013367.1013490 dblp:conf/www/CrainiceanuLGS04 fatcat:2mekyi4b7zexpgyhagkhdtmovu

Semantic-based Structural and Content indexing for the efficient retrieval of queries over large XML data repositories

Norah Saleh Alghamdi, Wenny Rahayu, Eric Pardede
2014 Future generations computer systems  
c t The emergence of XML adoption as semi-structured data representation in multi-disciplinary domains has highlighted the need to support the optimization of complex data retrieval processing.  ...  Our work focuses on optimizing the structural and the content part of XML queries by presenting a method for indexing and processing XML data based on the concept of objects that is formed from the semantic  ...  Acknowledgment The first author would like to express her gratitude to the Taif University in Saudi Arabia, for supporting her with a scholarship.  ... 
doi:10.1016/j.future.2014.02.010 fatcat:liwz6tqt4bfbbjrawrazwbb2zu

XML Information Retrieval Systems: A Survey [article]

Awny Sayed
2011 arXiv   pre-print
These systems exploit the available structural information, as market up in XML documents, in order to return documents components- the so called XML elements-instead of the complement documents in repose  ...  In this paper, we provide an overview of the different XML information retrieval systems and classify them according to their storage and query evaluation strategies.  ...  of such data in the absence of a schema and to support path expression evaluation, novel structural indexes [14] , [19] have been proposed for semi-structured data.  ... 
arXiv:1111.6349v1 fatcat:enerxjmwpnfwzd2p5vzlaew5eq
« Previous Showing results 1 — 15 out of 22,426 results