Sciweavers

4 search results - page 1 / 1
» Efficient top-k processing over query-dependent functions
Sort
View
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 5 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
EDBT
2006
ACM
126views Database» more  EDBT 2006»
15 years 3 months ago
Replication, Load Balancing and Efficient Range Query Processing in DHTs
We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peer data networks maintained over Distributed Hash ...
Theoni Pitoura, Nikos Ntarmos, Peter Triantafillou
EDBT
2009
ACM
170views Database» more  EDBT 2009»
15 years 5 months ago
Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases
The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's po...
Leticia I. Gómez, Alejandro A. Vaisman
EDBT
2004
ACM
143views Database» more  EDBT 2004»
16 years 1 months ago
OGSA-DQP: A Service for Distributed Querying on the Grid
OGSA-DQP is a distributed query processor exposed to users as an Open Grid Services Architecture (OGSA)-compliant Grid service. This service supports the compilation and evaluation...
M. Nedim Alpdemir, Arijit Mukherjee, Anastasios Go...