Sciweavers

6650 search results - page 381 / 1330
» Mutating database queries
Sort
View
230
Voted

Publication
535views
17 years 5 months ago
Continuous Evaluation of Monochromatic and Bichromatic Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general as it...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
SIGMOD
2007
ACM
150views Database» more  SIGMOD 2007»
16 years 5 months ago
Exploiting self-monitoring sample views for cardinality estimation
Good cardinality estimates are critical for generating good execution plans during query optimization. Complex predicates, correlations between columns, and user-defined functions...
Jingren Zhou, Per-Åke Larson, Peter Zabback,...
116
Voted
EDBT
2004
ACM
139views Database» more  EDBT 2004»
16 years 5 months ago
Efficient Distributed Skylining for Web Information Systems
Though skyline queries already have claimed their place in retrieval over central databases, their application in Web information systems up to now was impossible due to the distri...
Wolf-Tilo Balke, Ulrich Güntzer, Jason Xin Zh...
VLDB
2005
ACM
112views Database» more  VLDB 2005»
15 years 10 months ago
Content-Based Routing: Different Plans for Different Data
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
Pedro Bizarro, Shivnath Babu, David J. DeWitt, Jen...
VLDB
2004
ACM
97views Database» more  VLDB 2004»
15 years 10 months ago
Progressive Optimization in Action
Progressive Optimization (POP) is a technique to make query plans robust, and minimize need for DBA intervention, by repeatedly re-optimizing a query during runtime if the cardina...
Vijayshankar Raman, Volker Markl, David E. Simmen,...