Sciweavers

777 search results - page 84 / 156
» Optimization of Relational Preference Queries
Sort
View
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 11 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
WMCSA
2002
IEEE
14 years 3 months ago
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
We show how the database community’s notion of a generic query interface for data aggregation can be applied to ad-hoc networks of sensor devices. As has been noted in the senso...
Samuel Madden, Robert Szewczyk, Michael J. Frankli...
EDBT
1992
ACM
111views Database» more  EDBT 1992»
14 years 1 months 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
SAC
1997
ACM
14 years 2 months ago
Query Planning in Infomaster
Infomaster is an information integration system. It provides integrated access to distributed, heterogeneous information sources, thus giving its users the illusion of a centraliz...
Oliver M. Duschka, Michael R. Genesereth
VLDB
1989
ACM
155views Database» more  VLDB 1989»
14 years 2 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin