ACM Computing Surveys (CSUR)
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
D(k)-index: an adaptive structural summary for graph-structured data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Multiresolution Indexing of XML for Frequent Queries
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Incremental maintenance of XML structural indexes
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
On the integration of structure indexes and inverted lists
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Tree-pattern queries on a lightweight XML processor
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Structural characterizations of the semantics of XPath as navigation tool on a document
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
Covering indexes for XML queries: bisimulation - simulation = negation
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
XQGen: an algebra-based XPath query generator for micro-benchmarking
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient external-memory bisimulation on DAGs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
A structural approach to indexing triples
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
What we talk about when we talk about graphs
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Regularities and dynamics in bisimulation reductions of big graphs
First International Workshop on Graph Data Management Experiences and Systems
External memory K-bisimulation reduction of big graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
We introduce a new methodology for coupling language-induced partitions and index-induced partitions on XML documents that is aimed for the benefit of efficient evaluation of XPath queries. In particular, we identify XPath fragments which are ideally coupled with the newly introduced P(k)-partition which has its definition grounded in the well-known A(k) structural index and its associated partition. We then utilize these couplings to investigate fundamental questions about the use of structural indexes in XPath query evaluation.