Sciweavers

493 search results - page 33 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
DBISP2P
2006
Springer
185views Database» more  DBISP2P 2006»
15 years 2 months ago
Answering Constrained k-NN Queries in Unstructured P2P Systems
The processing of k-NN queries has been studied extensively both in a centralized computing environment and in a structured P2P environment. However, the problem over an unstructur...
Bin Wang, Xiaochun Yang, Guoren Wang, Lei Chen 000...
SIGMOD
1995
ACM
88views Database» more  SIGMOD 1995»
15 years 2 months ago
Semantic Assumptions and Query Evaluation in Temporal Databases
When querying a temporal database, a user often makes certain semantic assumptions on stored temporal data. This paper formalizes and studies two types of semantic assumptions: po...
Claudio Bettini, Xiaoyang Sean Wang, Elisa Bertino...
CIKM
2006
Springer
15 years 2 months ago
Efficient join processing over uncertain data
In an uncertain database, each data item is modeled as a range associated with a probability density function. Previous works for this kind of data have focussed on simple queries...
Reynold Cheng, Sarvjeet Singh, Sunil Prabhakar, Ra...
ICDE
2008
IEEE
188views Database» more  ICDE 2008»
16 years 14 days ago
Efficient Aggregate Computation over Data Streams
Abstract-- Cisco's NetFlow Collector (NFC) is a powerful example of a real-world product that supports multiple aggregate queries over a continuous stream of IP flow records. ...
Kanthi Nagaraj, K. V. M. Naidu, Rajeev Rastogi, Sc...
147
Voted
SIGMOD
2008
ACM
151views Database» more  SIGMOD 2008»
15 years 11 months ago
The DBO database system
We demonstrate our prototype of the DBO database system. DBO is designed to facilitate scalable analytic processing over large data archives. DBO's analytic processing perfor...
Florin Rusu, Fei Xu, Luis Leopoldo Perez, Mingxi W...