Sciweavers

356 search results - page 30 / 72
» Robust and efficient algorithms for rank join evaluation
Sort
View
VLDB
2004
ACM
98views Database» more  VLDB 2004»
15 years 3 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
14 years 11 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
CN
2006
113views more  CN 2006»
14 years 9 months ago
Failure recovery for structured p2p networks: Protocol design and performance under churn
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
Simon S. Lam, Huaiyu Liu
EDBT
2002
ACM
129views Database» more  EDBT 2002»
15 years 9 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
DEXA
2009
Springer
153views Database» more  DEXA 2009»
15 years 1 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...