Browsing by Subject "Storage management"

Now showing 1 - 3 of 3

Open Access
Efficient successor retrieval operations for aggregate query processing on clustered road networks
(Elsevier Inc., 2010) Demir, E.; Aykanat, Cevdet
Get-Successors (GS) which retrieves all successors of a junction is a kernel operation used to facilitate aggregate computations in road network queries. Efficient implementation of the GS operation is crucial since the disk access cost of this operation constitutes a considerable portion of the total query processing cost. Firstly, we propose a new successor retrieval operation Get-Unevaluated-Successors (GUS), which retrieves only the unevaluated successors of a given junction. The GUS operation is an efficient implementation of the GS operation, where the candidate successors to be retrieved are pruned according to the properties and state of the algorithm. Secondly, we propose a hypergraph-based model for clustering successively retrieved junctions by the GUS operations to the same pages. The proposed model utilizes query logs to correctly capture the disk access cost of GUS operations. The proposed GUS operation and associated clustering model are evaluated for two different instances of GUS operations which typically arise in Dijkstra's single source shortest path algorithm and incremental network expansion framework. Our simulation results show that the proposed successor retrieval operation together with the proposed clustering hypergraph model is quite effective in reducing the number of disk accesses in query processing. © 2010 Published by Elsevier Inc.
Open Access
A link-based storage scheme for efficient aggregate query processing on clustered road networks
(Elsevier Ltd, 2010) Demir, E.; Aykanat, Cevdet; Cambazoglu, B. B.
The need to have efficient storage schemes for spatial networks is apparent when the volume of query processing in some road networks (e.g., the navigation systems) is considered. Specifically, under the assumption that the road network is stored in a central server, the adjacent data elements in the network must be clustered on the disk in such a way that the number of disk page accesses is kept minimal during the processing of network queries. In this work, we introduce the link-based storage scheme for clustered road networks and compare it with the previously proposed junction-based storage scheme. In order to investigate the performance of aggregate network queries in clustered road networks, we extend our recently proposed clustering hypergraph model from junction-based storage to link-based storage. We propose techniques for additional storage savings in bidirectional networks that make the link-based storage scheme even more preferable in terms of the storage efficiency. We evaluate the performance of our link-based storage scheme against the junction-based storage scheme both theoretically and empirically. The results of the experiments conducted on a wide range of road network datasets show that the link-based storage scheme is preferable in terms of both storage and query processing efficiency. © 2009 Elsevier B.V. All rights reserved.
Open Access
Storage management and indexing in object-oriented database management systems
(1990) Al-Hajj, Reda
Storage management and indexing methods used in existing conventional database management systems are not appropriate for the object-oriented database management systems due to the distinctive features of the later systems. A model for storage management suitable for object- oriented database management systems is proposed in this thesis. It supports object identity, multiple inheritance, composite objects, a fine degree of granularity and schema evolution. An index provides fast access to data stored in files at the price of using additional storage space and an overhead in update operations. Work has been carried out on indexing and an indexing method for the object-oriented database systems is proposed. Identity and equality indexes are treated. Object identity and information hiding are provided. Schema changes are handled without affecting existing indexes. It is general enough to be applicable to most existing object-oriented database systems. The mapping of the proposed storage and indexing approaches into a relational database scheme is also presented.