Sciweavers

197 search results - page 7 / 40
» Implementation of Intention-driven Search Processes by SPARQ...
Sort
View
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
13 years 11 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
CIKM
2010
Springer
13 years 5 months ago
Building efficient multi-threaded search nodes
Search nodes are single-purpose components of large Web search engines and their efficient implementation is critical to sustain thousands of queries per second and guarantee indi...
Carolina Bonacic, Carlos García, Mauricio M...
VLDB
1997
ACM
141views Database» more  VLDB 1997»
13 years 11 months ago
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
Thomas Seidl, Hans-Peter Kriegel
EDBT
2011
ACM
256views Database» more  EDBT 2011»
12 years 11 months ago
RanKloud: a scalable ranked query processing framework on hadoop
The popularity of batch-oriented cluster architectures like Hadoop is on the rise. These batch-based systems successfully achieve high degrees of scalability by carefully allocati...
K. Selçuk Candan, Parth Nagarkar, Mithila N...
ICADL
2005
Springer
114views Education» more  ICADL 2005»
14 years 1 months ago
Scalability of Databases for Digital Libraries
Search engines of main-stream literature digital libraries such as ACM Digital Library, Google Scholar, and PubMed employ file-based systems, and provide users with a basic boolean...
John Chmura, Nattakarn Ratprasartporn, Gultekin &O...