Sciweavers

651 search results - page 64 / 131
» Algebraic Query Optimization for Distributed Top-k Queries
Sort
View
DASFAA
2005
IEEE
256views Database» more  DASFAA 2005»
14 years 2 months ago
CoCache: Query Processing Based on Collaborative Caching in P2P Systems
Peer-to-peer (P2P) computing is gaining more and more significance due to its widespread use currently and potential deployments in future applications. In this paper, we propose ...
Weining Qian, Linhao Xu, Shuigeng Zhou, Aoying Zho...
SSD
2007
Springer
243views Database» more  SSD 2007»
14 years 3 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 10 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
VLDB
1992
ACM
116views Database» more  VLDB 1992»
14 years 1 months ago
Supporting Lists in a Data Model (A Timely Approach)
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
Joel E. Richardson
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
14 years 10 months ago
Top-k Query Processing in Uncertain Databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditio...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...