Sciweavers

288 search results - page 18 / 58
» Beyond the traditional query operators
Sort
View
174
Voted
ICDE
2003
IEEE
138views Database» more  ICDE 2003»
15 years 11 months ago
Using State Modules for Adaptive Query Processing
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
Vijayshankar Raman, Amol Deshpande, Joseph M. Hell...
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
15 years 11 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...
VLDB
1994
ACM
114views Database» more  VLDB 1994»
15 years 1 months ago
Including Group-By in Query Optimization
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Surajit Chaudhuri, Kyuseok Shim
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
15 years 11 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
13 years 1 days ago
Aggregate Query Answering on Possibilistic Data with Cardinality Constraints
— Uncertainties in data arise for a number of reasons: when the data set is incomplete, contains conflicting information or has been deliberately perturbed or coarsened to remov...
Graham Cormode, Divesh Srivastava, Entong Shen, Ti...