Sciweavers

610 search results - page 30 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
SIGMOD
1994
ACM
99views Database» more  SIGMOD 1994»
15 years 4 months ago
Optimizing Queries on Files
We present a framework which allows the user to access and manipulate data uniformly, regardless of whether it resides in a database or in the file system (or in both). A key issu...
Mariano P. Consens, Tova Milo
PPDP
2010
Springer
14 years 10 months ago
Precise complexity analysis for efficient datalog queries
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
K. Tuncay Tekle, Yanhong A. Liu
190
Voted
VLDB
2005
ACM
109views Database» more  VLDB 2005»
16 years 22 days ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
186
Voted
ICDE
2002
IEEE
149views Database» more  ICDE 2002»
16 years 1 months ago
GADT: A Probability Space ADT for Representing and Querying the Physical World
Large sensor networks are being widely deployed for measurement, detection, and monitoring applications. Many of these applications involve database systems to store and process d...
Anton Faradjian, Johannes Gehrke, Philippe Bonnet
194
Voted
ICDE
2003
IEEE
145views Database» more  ICDE 2003»
16 years 1 months ago
PXML: A Probabilistic Semistructured Data Model and Algebra
Despite the recent proliferation of work on semistructured data models, there has been little work to date on supporting uncertainty in these models. In this paper, we propose a m...
Edward Hung, Lise Getoor, V. S. Subrahmanian