Sciweavers

9683 search results - page 283 / 1937
» Query performance prediction
Sort
View
EDBT
2010
ACM
392views Database» more  EDBT 2010»
15 years 10 months ago
Position list word aligned hybrid: optimizing space and performance for compressed bitmaps
Compressed bitmap indexes are increasingly used for efficiently querying very large and complex databases. The Word Aligned Hybrid (WAH) bitmap compression scheme is commonly rec...
François Deliège, Torben Bach Peders...
ICDCS
2005
IEEE
15 years 9 months ago
Filter Based Directory Replication: Algorithms and Performance
Directories have become an important component of the enterprise security and identity management middleware. This paper describes a novel filter based replication model for Light...
Apurva Kumar
ISMIR
2004
Springer
133views Music» more  ISMIR 2004»
15 years 9 months ago
Understanding Search Performance in Query-by-Humming Systems
Previous work in Query-by-Humming systems has left open many questions. Although a variety of techniques have been explored, there has been relatively little work to compare them ...
Roger B. Dannenberg, Ning Hu
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 3 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
ALT
1995
Springer
15 years 7 months ago
Learning Unions of Tree Patterns Using Queries
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara