Sciweavers

115 search results - page 11 / 23
» Adaptable Query Optimization and Evaluation in Temporal Midd...
Sort
View
JSS
2007
120views more  JSS 2007»
14 years 9 months ago
The design and evaluation of path matching schemes on compressed control flow traces
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
Yongjing Lin, Youtao Zhang, Rajiv Gupta
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 2 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
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...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
15 years 10 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
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 2 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
DEBU
2000
118views more  DEBU 2000»
14 years 9 months ago
A Dynamic Query Processing Architecture for Data Integration Systems
Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the mem...
Luc Bouganim, Françoise Fabret, C. Mohan, P...