Sciweavers

301 search results - page 29 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
ELPUB
2006
ACM
15 years 5 months ago
Encoding and Querying Multi-Structured Documents
This paper concerns the document multi-structuring issue. For various use objectives, many distinct structures may be defined simultaneously for the same original document. For ex...
Noureddine Chatti, Sylvie Calabretto, Jean-Marie P...
WWW
2008
ACM
15 years 11 months ago
Efficient multi-keyword search over p2p web
Current search mechanisms of DHT-based P2P systems can well handle a single keyword search problem. Other than single keyword search, multi-keyword search is quite popular and use...
Hanhua Chen, Hai Jin, Jiliang Wang, Lei Chen 0002,...
186
Voted
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 11 days ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
15 years 11 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
AAAI
2010
15 years 14 days ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa