Sciweavers

418 search results - page 44 / 84
» Optimizing Large Join Queries in Mediation Systems
Sort
View
COMAD
2008
13 years 9 months ago
Exploiting Asynchronous IO using the Asynchronous Iterator Model
Asynchronous IO (AIO) allows a process to continue to do other work while an IO operation initiated earlier completes. AIO allows a large number of random IO operations to be issu...
Suresh Iyengar, S. Sudarshan, Santosh Kumar 0002, ...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 7 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
14 years 1 months ago
Acceleration of Relational Index Structures Based on Statistics
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
KR
2004
Springer
14 years 1 months ago
Optimization Techniques for Retrieving Resources Described in OWL/RDF Documents: First Results
Practical description logic systems play an ever-growing role for knowledge representation and reasoning research even in distributed environments. In particular, the often-discus...
Volker Haarslev, Ralf Möller
ICDE
2007
IEEE
153views Database» more  ICDE 2007»
14 years 2 months ago
An Indexing Structure for Automatic Schema Matching
Querying semantically related data sources depends on the ability to map between their schemas. Unfortunately, in most cases matching between schema is still largely performed man...
Fabien Duchateau, Zohra Bellahsene, Mark Roantree,...