Sciweavers

2492 search results - page 209 / 499
» Ontology-based Database Access
Sort
View
137
Voted
ADC
1999
Springer
68views Database» more  ADC 1999»
15 years 10 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
VLDB
1994
ACM
148views Database» more  VLDB 1994»
15 years 10 months ago
Cache Conscious Algorithms for Relational Query Processing
The current main memory (DRAM) access speeds lag far behind CPU speeds. Cache memory, made of static RAM, is being used in today's architectures to bridge this gap. It provid...
Ambuj Shatdal, Chander Kant, Jeffrey F. Naughton
VLDB
1992
ACM
83views Database» more  VLDB 1992»
15 years 10 months ago
A Performance Study of Alternative Object Faulting and Pointer Swizzling Strategies
This paper presents a portable, efficient method for accessing memory resident persistent objects in virtual memory in the context of the E programming language. Under the approac...
Seth J. White, David J. DeWitt
197
Voted
DEXAW
2004
IEEE
166views Database» more  DEXAW 2004»
15 years 10 months ago
Development of Flexible Peer-To-Peer Information Systems Using Adaptable Mobile Agents
Wide-area networks provide an easy access to many different distributed and heterogeneous data sources. The development of automated operating tools is still complex, particularly...
Jean-Paul Arcangeli, Sebastien Leriche, Marc Pante...
IS
2007
15 years 6 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...