Sciweavers

76 search results - page 2 / 16
» Boolean ranking: querying a database by k-constrained opti...
Sort
View
IDEAS
2002
IEEE
135views Database» more  IDEAS 2002»
13 years 10 months ago
On Implicate Discovery and Query Optimization
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Kristofer Vorwerk, G. N. Paulley
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 5 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
TKDE
1998
184views more  TKDE 1998»
13 years 5 months ago
Supporting Ranked Boolean Similarity Queries in MARS
To address the emerging needs of applications that require access to and retrieval of multimedia objects, we are developing the Multimedia Analysis and Retrieval System (MARS) 29]...
Michael Ortega, Yong Rui, Kaushik Chakrabarti, Kri...
ADBIS
2005
Springer
100views Database» more  ADBIS 2005»
13 years 11 months ago
Evolutionary Learning of Boolean Queries by Genetic Programming
Abstract. The performance of an information retrieval system is usually measured in terms of two different criteria, precision and recall. This way, the optimization of any of its...
Suhail S. J. Owais, Pavel Krömer, Václ...
IKE
2003
13 years 6 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