Sciweavers

757 search results - page 30 / 152
» Topical query decomposition
Sort
View
EUSFLAT
2001
107views Fuzzy Logic» more  EUSFLAT 2001»
15 years 3 months ago
Introducing the aggregate "count" into flexible queries
Flexible querying aims at expressing preferences inside queries instead of strict requirements. We consider ordinary relational databases and flexible querying calling on fuzzy se...
Patrick Bosc, Ludovic Lietard
ICDT
2007
ACM
118views Database» more  ICDT 2007»
15 years 8 months ago
Consistent Query Answering: Five Easy Pieces
Abstract. Consistent query answering (CQA) is an approach to querying inconsistent databases without repairing them first. This invited talk introduces the basics of CQA, and disc...
Jan Chomicki
TREC
2000
15 years 3 months ago
Query Expansion Seen Through Return Order of Relevant Documents
There is a reservoir of knowledge in data from the TREC evaluations that analysis of precision and recall leaves untapped. This knowledge leads to better understanding of query ex...
Walter Liggett, Chris Buckley
SIGIR
2009
ACM
15 years 8 months ago
Named entity recognition in query
This paper addresses the problem of Named Entity Recognition in Query (NERQ), which involves detection of the named entity in a given query and classification of the named entity...
Jiafeng Guo, Gu Xu, Xueqi Cheng, Hang Li
WOLLIC
2009
Springer
15 years 8 months ago
Spoilt for Choice: Full First-Order Hierarchical Decompositions
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
Sebastian Link