Sciweavers

363 search results - page 32 / 73
» Linked Data Query Processing Strategies
Sort
View
HPDC
2010
IEEE
14 years 1 days ago
New caching techniques for web search engines
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...
Mauricio Marín, Veronica Gil Costa, Carlos ...
IDEAS
2000
IEEE
108views Database» more  IDEAS 2000»
14 years 3 months ago
Plug and Play with Query Algebras: SECONDO-A Generic DBMS Development Environment
We present SECONDO, a new generic environment supporting the implementation of database systems for a wide range of data models and query languages. On the one hand, this framewor...
Stefan Dieker, Ralf Hartmut Güting
SISAP
2008
IEEE
147views Data Mining» more  SISAP 2008»
14 years 5 months ago
An Empirical Evaluation of a Distributed Clustering-Based Index for Metric Space Databases
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
Veronica Gil Costa, Mauricio Marín, Nora Re...
ADHOC
2010
317views more  ADHOC 2010»
13 years 7 months ago
Simple ant routing algorithm strategies for a (Multipurpose) MANET model
A Mobile Ad-hoc Network has limited and scarce resources and thus routing protocols in such environments must be kept as simple as possible. The Simple Ant Routing Algorithm (SARA...
Fernando Correia, Teresa Vazão
VLDB
1995
ACM
129views Database» more  VLDB 1995»
14 years 2 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...