Sciweavers

2217 search results - page 29 / 444
» Rank-aware Query Optimization
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 10 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
SIGKDD
2002
93views more  SIGKDD 2002»
13 years 9 months ago
A Perspective on Inductive Databases
Inductive databases tightly integrate databases with data mining. The key ideas are that data and patterns (or models) are handled in the same way and that an inductive query lang...
Luc De Raedt
SIGMOD
2003
ACM
105views Database» more  SIGMOD 2003»
14 years 9 months ago
Factorizing Complex Predicates in Queries to Exploit Indexes
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...
Surajit Chaudhuri, Prasanna Ganesan, Sunita Sarawa...
CIKM
2005
Springer
14 years 3 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
SSD
2001
Springer
119views Database» more  SSD 2001»
14 years 2 months ago
Constrained Nearest Neighbor Queries
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as neare...
Hakan Ferhatosmanoglu, Ioana Stanoi, Divyakant Agr...