Sciweavers

951 search results - page 71 / 191
» Groupwise Processing of Relational Queries
Sort
View
SIGIR
2003
ACM
15 years 3 months ago
Query length in interactive information retrieval
Query length in best-match information retrieval (IR) systems is well known to be positively related to effectiveness in the IR task, when measured in experimental, non-interactiv...
Nicholas J. Belkin, Diane Kelly, G. Kim, Ja-Young ...
LAWEB
2005
IEEE
15 years 3 months ago
Incentive Networks
The concurrent growth of on-line communities exhibiting large-scale social structure, and of large decentralized peer-to-peer file-sharing systems, has stimulated new interest in...
Prabhakar Raghavan
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 9 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
CIKM
2005
Springer
15 years 3 months ago
Indexing time vs. query time: trade-offs in dynamic information retrieval systems
We examine issues in the design of fully dynamic information retrieval systems with support for instantaneous document insertions and deletions. We present one such system and dis...
Stefan Büttcher, Charles L. A. Clarke
PODS
2010
ACM
242views Database» more  PODS 2010»
15 years 3 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak