136 search results - page 21 / 28 » Optimization and Dataflow Algorithms for Nested Tree Queries |
VLDB
2002
ACM
13 years 9 months ago
2002
ACM
With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important...
EDBT
2000
ACM
14 years 2 months ago
2000
ACM
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
DASFAA
2004
IEEE
14 years 1 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
SBBD
2004
13 years 11 months ago
2004
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...