Sciweavers

109 search results - page 3 / 22
» Example-driven design of efficient record matching queries
Sort
View
102
Voted
DPD
2008
136views more  DPD 2008»
15 years 1 months ago
A cache invalidation scheme for continuous partial match queries in mobile computing environments
The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile client...
Yon Dohn Chung
117
Voted
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...
185
Voted
SIGMOD
2008
ACM
161views Database» more  SIGMOD 2008»
16 years 1 months ago
Efficient pattern matching over event streams
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Ne...
187
Voted
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 3 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
104
Voted
ICASSP
2008
IEEE
15 years 7 months ago
Fast query by example of environmental sounds via robust and efficient cluster-based indexing
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
Jiachen Xue, Gordon Wichern, Harvey D. Thornburg, ...