Sciweavers

726 search results - page 50 / 146
» Capacity-Constrained Query Formulation
Sort
View
CIKM
2011
Springer
14 years 2 months ago
Factorization-based lossless compression of inverted indices
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...
CLEF
2009
Springer
15 years 3 months ago
Prior Art Search Using International Patent Classification Codes and All-Claims-Queries
In this study, we describe our system at the Intellectual Property track of the 2009 CrossLanguage Evaluation Forum campaign (CLEF-IP). The CLEF-IP track addressed prior art searc...
Benjamin Herbert, György Szarvas, Iryna Gurev...
192
Voted
VLDB
2007
ACM
159views Database» more  VLDB 2007»
16 years 2 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
175
Voted
SIGMOD
2007
ACM
111views Database» more  SIGMOD 2007»
16 years 2 months ago
Query relaxation using malleable schemas
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
Xuan Zhou, Julien Gaugaz, Wolf-Tilo Balke, Wolfgan...
SAC
2009
ACM
15 years 9 months ago
Building an efficient preference XML query processor
Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enablin...
SungRan Cho, Wolf-Tilo Balke