Sciweavers

8 search results - page 1 / 2
» The use of hints in object-relational query optimization
Sort
View
CSSE
2004
IEEE
13 years 4 months ago
The use of hints in object-relational query optimization
David Taniar, Hui Yee Khaw, Haorianto Cokrowijoyo ...
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
13 years 8 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICDE
2010
IEEE
247views Database» more  ICDE 2010»
14 years 4 months ago
Efficient Verification of Shortest Path Search via Authenticated Hints
Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanni...
Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis
ECOOP
2006
Springer
13 years 8 months ago
Automatic Prefetching by Traversal Profiling in Object Persistence Architectures
Object persistence architectures support transparent access to persistent objects. For efficiency, many of these architectures support queries that can prefetch associated objects ...
Ali Ibrahim, William R. Cook
VLDB
1998
ACM
138views Database» more  VLDB 1998»
13 years 8 months ago
TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
Clara Nippl, Bernhard Mitschang