Sciweavers

493 search results - page 85 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
ADBIS
2001
Springer
107views Database» more  ADBIS 2001»
15 years 2 months ago
The Impact of Buffering on Closest Pairs Queries Using R-Trees
In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...
ICDE
2005
IEEE
131views Database» more  ICDE 2005»
16 years 12 days ago
On the Sequencing of Tree Structures for XML Indexing
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...
Haixun Wang, Xiaofeng Meng
POST
2012
218views more  POST 2012»
13 years 6 months ago
A Core Calculus for Provenance
Provenance is an increasing concern due to the revolution in sharing and processing scientific data on the Web and in other computer systems. It is proposed that many computer sys...
Umut A. Acar, Amal Ahmed, James Cheney, Roly Perer...
VLDB
2004
ACM
134views Database» more  VLDB 2004»
15 years 4 months ago
Model-Driven Data Acquisition in Sensor Networks
Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that “the sensornet is a database” is problematic,...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
WWW
2005
ACM
15 years 11 months ago
Executing incoherency bounded continuous queries at web data aggregators
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, Ashish Puri, Krithi Ramamritham