Sciweavers

6004 search results - page 93 / 1201
» Parallelizing query optimization
Sort
View
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
IPPS
1999
IEEE
14 years 2 months ago
GA-Based Parallel Image Registration on Parallel Clusters
Genetic Algorithms (GAs) have been known to be robust for search and optimization problems. Image registration can take advantage of the robustness of GAs in finding best transform...
Prachya Chalermwat, Tarek A. El-Ghazawi, Jacquelin...
SIGMOD
2003
ACM
105views Database» more  SIGMOD 2003»
14 years 10 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
PLDI
2012
ACM
12 years 13 days ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...