The history of histograms (abridged)

Y Ioannidis - Proceedings 2003 VLDB Conference, 2003 - Elsevier
Publisher Summary The history of histograms is long and rich, full of detailed information in
every step. It includes the course of histograms in different scientific fields, the successes …

Approximate XML query answers

N Polyzotis, M Garofalakis, Y Ioannidis - Proceedings of the 2004 ACM …, 2004 - dl.acm.org
The rapid adoption of XML as the standard for data representation and exchange
foreshadows a massive increase in the amounts of XML data collected, maintained, and …

[PDF][PDF] An efficient and versatile query engine for TopX search

M Theobald, R Schenkel, G Weikum - Proceedings of the 31st …, 2005 - csd.uoc.gr
This paper presents a novel engine, coined TopX, for efficient ranked retrieval of XML
documents over semistructured but nonschematic data collections. The algorithm follows the …

TopX: efficient and versatile top-k query processing for semistructured data

M Theobald, H Bast, D Majumdar, R Schenkel… - The VLDB Journal, 2008 - Springer
Recent IR extensions to XML query languages such as Xpath 1.0 Full-Text or the NEXI
query language of the INEX benchmark series reflect the emerging interest in IR-style …

Structural XML query processing

R Bača, M Krátký, I Holubová, M Nečaský… - ACM Computing …, 2017 - dl.acm.org
Since the boom in new proposals on techniques for efficient querying of XML data is now
over and the research world has shifted its attention toward new types of data formats, we …

Localizing non-affine array references

N Mitchell, L Carter, J Ferrante - 1999 International Conference …, 1999 - ieeexplore.ieee.org
Existing techniques can enhance the locality of arrays indexed by affine functions of
induction variables. This paper presents a technique to localize non-affine array references …

[PDF][PDF] Bloom histogram: Path selectivity estimation for xml data with updates

W Wang, H Jiang, H Lu, JX Yu - … of the Thirtieth international conference on …, 2004 - vldb.org
Cost-based XML query optimization calls for accurate estimation of the selectivity of path
expressions. Some other interactive and internet applications can also benefit from such …

Selectivity estimation for string predicates: Overcoming the underestimation problem

S Chaudhuri, V Ganti, L Gravano - … International Conference on …, 2004 - ieeexplore.ieee.org
Queries with (equality or LIKE) selection predicates over string attributes are widely used in
relational databases. However, state-of-the-art techniques for estimating selectivities of …

[PDF][PDF] Extending q-grams to estimate selectivity of string matching with low edit distance

H Lee, RT Ng, K Shim - Proceedings of the 33rd international conference …, 2007 - Citeseer
There are many emerging database applications that require accurate selectivity estimation
of approximate string matching queries. Edit distance is one of the most commonly used …

Selectivity estimation for XML twigs

N Polyzotis, M Garofalakis… - … Conference on Data …, 2004 - ieeexplore.ieee.org
Twig queries represent the building blocks of declarative query languages over XML data. A
twig query describes a complex traversal of the document graph and generates a set of …