Sciweavers

107 search results - page 10 / 22
» Approximate Query Answering by Model Averaging
Sort
View
COMPGEOM
2010
ACM
14 years 22 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
NGITS
1999
Springer
13 years 12 months ago
Multiplex: A Formal Model for Multidatabases and Its Implementation
The integration of information from multiple databases has been an enduring subject of research for over 20 years, and many different solutions have been attempted or proposed. Mis...
Amihai Motro
JSS
2006
58views more  JSS 2006»
13 years 7 months ago
A semantic-based P2P resource organization model R-Chord
This paper proposes a semantic-based P2P resource organization model R-Chord by incorporating the Resource Space Model (RSM), the P2P Semantic Link Network Model (P2PSLN) and the ...
Jie Liu, Hai Zhuge
ICDE
2005
IEEE
115views Database» more  ICDE 2005»
14 years 9 months ago
Snapshot Queries: Towards Data-Centric Sensor Networks
In this paper we introduce the idea of snapshot queries for energy efficient data acquisition in sensor networks. Network nodes generate models of their surrounding environment th...
Yannis Kotidis
WWW
2007
ACM
14 years 8 months ago
Optimized query planning of continuous aggregation queries in dynamic data dissemination networks
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Krithi Ramamritham