Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The XML benchmark project
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A flexible extension of XPath to improve XML querying
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
FuzzyXPath: Using Fuzzy Logic an IR Features to Approximately Query XML Documents
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
Query Optimization for Complex Path Queries on XML Data
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
A fuzzy extension of the XPath query language
Journal of Intelligent Information Systems
A compressed self-indexed representation of XML documents
ECDL'09 Proceedings of the 13th European conference on Research and advanced technology for digital libraries
Hi-index | 0.00 |
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure range queries efficiently, an XML query processing engine needs to incorporate effective indexing and summarization techniques to efficiently partition the XML document and locate the results. In this paper, we propose a dynamic summarization and indexing method, FLUX, based on Bloom filters and B+-trees to tackle these problems. The results of our extensive experimental evaluations indicated the efficiency of the proposed system.