Xseed: Accurate and fast cardinality estimation for xpath queries
N Zhang, MT Ozsu, A Aboulnaga… - … Conference on Data …, 2006 - ieeexplore.ieee.org
22nd International Conference on Data Engineering (ICDE'06), 2006•ieeexplore.ieee.org
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 …
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 …
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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果