Sciweavers

785 search results - page 51 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
EDBT
2010
ACM
164views Database» more  EDBT 2010»
14 years 5 days ago
Techniques for efficiently querying scientific workflow provenance graphs
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
Manish Kumar Anand, Shawn Bowers, Bertram Ludä...
CIDR
2009
145views Algorithms» more  CIDR 2009»
13 years 10 months ago
Continuous Analytics: Rethinking Query Processing in a Network-Effect World
Modern data analysis applications driven by the Network Effect are pushing traditional database and data warehousing technologies beyond their limits due to their massively increa...
Michael J. Franklin, Sailesh Krishnamurthy, Neil C...
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
14 years 10 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
WWW
2009
ACM
14 years 9 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
14 years 9 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy