Sciweavers

707 search results - page 80 / 142
» Processing queries on tree-structured data efficiently
Sort
View
CIKM
2008
Springer
13 years 10 months ago
Workload-based optimization of integration processes
The efficient execution of integration processes between distributed, heterogeneous data sources and applications is a challenging research area of data management. These inn proc...
Matthias Böhm, Uwe Wloka, Dirk Habich, Wolfga...
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
14 years 10 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
SDM
2010
SIAM
183views Data Mining» more  SDM 2010»
13 years 10 months ago
GraSS: Graph Structure Summarization
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
Kristen LeFevre, Evimaria Terzi
EDBT
2004
ACM
126views Database» more  EDBT 2004»
14 years 8 months ago
Spatial Queries in the Presence of Obstacles
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis,...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 9 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes