958 search results - page 141 / 192 » Efficient data structures for range-aggregate queries on tre... |
170
click to vote
JACM
2008
15 years 4 months ago
2008
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
137
click to vote
COMPGEOM
2007
ACM
15 years 8 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
258
click to vote
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
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 el...
160
click to vote
SEM
2004
Springer
15 years 9 months ago
2004
Springer
Large-scale information processing applications must rapidly search through high volume streams of structured and unstructured textual data to locate useful information. Content-ba...
240
Voted
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...