Sciweavers

588 search results - page 30 / 118
» Positive higher-order queries
Sort
View
98
Voted
ADC
1999
Springer
68views Database» more  ADC 1999»
15 years 6 months ago
A Query-sensitive Cost Model for Similarity Queries with M-tree
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...
Paolo Ciaccia, A. Nanni, Marco Patella
121
Voted
PODS
1998
ACM
116views Database» more  PODS 1998»
15 years 6 months ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka
TREC
2007
15 years 3 months ago
Query and Document Models for Enterprise Search
: We describe our participation in the TREC 2007 Enterprise track and detail our language modeling-based approaches. For document search, our focus was on estimating a mixture mode...
Krisztian Balog, Katja Hofmann, Wouter Weerkamp, M...
115
Voted
LCN
2006
IEEE
15 years 7 months ago
Cerco: Supporting Range Queries with a Hierarchically Structured Peer-to-Peer System
Structured Peer-to-Peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called Distributed Hash Tables (DHTs) ...
Simon Rieche, Klaus Wehrle, Leo Petrak, Clemens Wr...
SAC
1997
ACM
15 years 6 months ago
Query Planning in Infomaster
Infomaster is an information integration system. It provides integrated access to distributed, heterogeneous information sources, thus giving its users the illusion of a centraliz...
Oliver M. Duschka, Michael R. Genesereth