Sciweavers

166 search results - page 3 / 34
» Extending the Search Strategy in a Query Optimizer
Sort
View
PSSS
2003
13 years 8 months ago
Extending Classical Theorem Proving for the Semantic Web
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
Tanel Tammet
CIKM
2005
Springer
14 years 27 days 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
SISAP
2008
IEEE
130views Data Mining» more  SISAP 2008»
14 years 1 months ago
The Many Facets of Approximate Similarity Search
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
Marco Patella, Paolo Ciaccia
JOT
2010
108views more  JOT 2010»
13 years 5 months ago
Extending Scala with Database Query Capability
Abstract The integration of database and programming languages is difficult due to the different data models and type systems prevalent in each field. We present a solution wher...
Miguel Garcia, Anastasia Izmaylova, Sibylle Schupp
WISE
2007
Springer
14 years 1 months ago
Optimization of Bounded Continuous Search Queries Based on Ranking Distributions
A common search problem in the World Wide Web concerns finding information if it is not known when the sources of information appear and how long sources will be available on the ...
Dirk Kukulenz, Nils Hoeller, Sven Groppe, Volker L...