Sciweavers

412 search results - page 5 / 83
» Ranked Join Indices
Sort
View
IIS
2004
13 years 7 months ago
Query Selectivity Estimation via Data Mining
Estimating the result size of a join is an important query optimization problem as it determines the choice of a good query evaluation strategy. Yet, there are few efficient techni...
Jarek Gryz, Dongming Liang
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 6 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
VLDB
1994
ACM
99views Database» more  VLDB 1994»
13 years 10 months ago
Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...
Zhaohui Xie, Jiawei Han
PODS
1999
ACM
121views Database» more  PODS 1999»
13 years 10 months ago
Tracking Join and Self-Join Sizes in Limited Storage
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
Noga Alon, Phillip B. Gibbons, Yossi Matias, Mario...
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 7 months ago
A Lightweight Online Framework For Query Progress Indicators
Recently there has been increasing interest in the development of progress indicators for SQL queries. In this paper we present a lightweight online framework for this problem. Ou...
Chaitanya Mishra, Nick Koudas