Sciweavers

IKE
2003
14 years 1 months ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung
PODS
2000
ACM
179views Database» more  PODS 2000»
14 years 4 months ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
CINQ
2004
Springer
118views Database» more  CINQ 2004»
14 years 5 months ago
Boolean Formulas and Frequent Sets
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
Jouni K. Seppänen, Heikki Mannila
AMAI
2004
Springer
14 years 5 months ago
Learning via Finitely Many Queries
This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the pa...
Andrew C. Lee
LICS
2005
IEEE
14 years 6 months ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin