Sciweavers

589 search results - page 4 / 118
» Optimized Query Evaluation Using Cooperative Sorts
Sort
View
EDBT
2010
ACM
122views Database» more  EDBT 2010»
14 years 2 months ago
Self-selecting, self-tuning, incrementally optimized indexes
: © Self-selecting, self-tuning, incrementally optimized indexes Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-24 database index, adaptive, autonomic, query execution In a re...
Goetz Graefe, Harumi A. Kuno
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
14 years 26 days ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma
ICMCS
2006
IEEE
120views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Shape-Based Visual Query Rewriting
A visual query is based on pictorial representation of conceptual entities and operations. One of the most important features used in visual queries is the shape. Despite its intu...
Georges Chalhoub, Richard Chbeir, Kokou Yét...
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 7 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 7 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang