Sciweavers

907 search results - page 92 / 182
» Efficient Optimization of Iterative Queries
Sort
View
DKE
2006
123views more  DKE 2006»
13 years 9 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
EDBT
1992
ACM
111views Database» more  EDBT 1992»
14 years 16 days ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin
VLDB
1991
ACM
157views Database» more  VLDB 1991»
14 years 16 days ago
Integrating Implicit Answers with Object-Oriented Queries
Queries in object-oriented datab;Lqcs are formulated against a class and retrieve instnnccls of the class sat,isfying a certain predicate on the att,riblltes of the class. The pre...
Hava T. Siegelmann, B. R. Badrinath
ICDE
2000
IEEE
125views Database» more  ICDE 2000»
14 years 10 months ago
An Algebraic Compression Framework for Query Results
Decision-support applications in emerging environments require that SQL query results or intermediate results be shipped to clients for further analysis and presentation. These cl...
Zhiyuan Chen, Praveen Seshadri
AIPS
2008
13 years 11 months ago
A Compact and Efficient SAT Encoding for Planning
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
Nathan Robinson, Charles Gretton, Duc Nghia Pham, ...