Sciweavers

1300 search results - page 223 / 260
» XML Query Processing and Optimization
Sort
View
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
16 years 3 months ago
Greedy List Intersection
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...
Robert Krauthgamer, Aranyak Mehta, Vijayshankar Ra...
VLDB
1995
ACM
129views Database» more  VLDB 1995»
15 years 5 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
DKE
2007
119views more  DKE 2007»
15 years 1 months ago
Error minimization in approximate range aggregates
Histogram techniques have been used in many commercial database management systems to estimate a query result size. Recently, it has been shown that they are very effective to su...
Xuemin Lin, Qing Zhang, Yidong Yuan, Qing Liu
JIIS
2006
76views more  JIIS 2006»
15 years 1 months ago
Holes in joins
A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...
Jarek Gryz, Dongming Liang
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
16 years 1 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han