829 search results - page 91 / 166 » Location-aware Query Processing and Optimization |
112
Voted
EDBT
2004
ACM
16 years 23 days ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
123
Voted
VLDB
1995
ACM
15 years 4 months ago
1995
ACM
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
100
Voted
VLDB
2004
ACM
15 years 6 months ago
2004
ACM
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
114
Voted
DKE
2006
15 years 20 days ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
152
Voted
SSDBM
2002
IEEE
15 years 5 months ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...