Sciweavers

1588 search results - page 42 / 318
» Consistent query answering in databases
Sort
View
126
Voted
SARA
2007
Springer
15 years 10 months ago
Reformulation for Extensional Reasoning
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...
Timothy L. Hinrichs, Michael R. Genesereth
MDM
2010
Springer
180views Communications» more  MDM 2010»
15 years 8 months ago
Online Time Interval Top-k Queries in Wireless Sensor Networks
Motivated by many applications, top-k query is a fundamental operation in modern database systems. Technological advances have enabled the deployment of large-scale sensor networks...
Baichen Chen, Weifa Liang, Jeffrey Xu Yu
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 6 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
TKDE
2008
234views more  TKDE 2008»
15 years 3 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
TIME
2007
IEEE
15 years 10 months ago
On Construction of Holistic Synopses under the Duplicate Semantics of Streaming Queries
Transaction-time temporal databases and query languages provide a solid framework for analyzing properties of queries over data streams. In this paper we focus on issues connected...
David Toman