XSKETCH synopses for XML data graphs
ACM Transactions on Database Systems (TODS)
Succinct indexes for strings, binary relations and multi-labeled trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Cardinality estimation for the optimization of queries on ontologies
ACM SIGMOD Record
Accurate histogram-based XML summarization
Proceedings of the 2008 ACM symposium on Applied computing
EXsum: an XML summarization framework
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Usage-driven storage structures for native XML databases
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
TuG synopses for approximate query answering
ACM Transactions on Database Systems (TODS)
A sampling approach for XML query selectivity estimation
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Progressive Evaluation of XML Queries for Online Aggregation and Progress Indicator
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
BNCOD'07 Proceedings of the 24th British national conference on Databases
Towards a comprehensive assessment for selectivity estimation approaches of XML queries
International Journal of Web Engineering and Technology
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
Index vs. navigation in XPath evaluation
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Top-K data source selection for keyword queries over multiple XML data sources
Journal of Information Science
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel, and then incrementally updates information of the synopsis. With such an incremental construction, a synopsis structure can be dynamically configured to accommodate different memory budgets. Cardinality estimation based on XSEED can be performed very efficiently and accurately. Extensive experiments on both synthetic and real data sets show that even with less memory, XSEED could achieve accuracy that is an order of magnitude better than that of other synopsis structures. The cardinality estimation time is under 2% of the actual querying time for a wide range of queries in all test cases.