Abstract
Query Optimization in Object Oriented Databases Based on SD-Tree and n-ary Tree
Highlights
Direct query on objects in object-oriented databases costs a lot of data storage during processing query and time to execute query on real data system
The main idea is that each SD-Tree on a class in hierarchy is remained but indexes are nested by relation of subclass – target class
Base on theory and suggested algorithms, this paper proposes an approach which combines signature file hierarchy with SD-Tree as follows: (1) all of signature files are organized in hierarchical structure to make it easier for executing stepwise filtering technique; (2) each signature file is stored in form of SD-Tree structure to speed up signature file scanning
Summary
Direct query on objects in object-oriented databases costs a lot of data storage during processing query and time to execute query on real data system. To reduce space of data query, proposed indexing techniques used to evaluate query in databases [7] have been developed based on binary tree balancing mechanism which was added some special characteristics to reduce tree balance or minimize accesses to data files. These techniques have been developed to increase query speed in object-oriented databases [11, 12, 13]. It is necessary to construct a data structure for signature file storage to improve searching.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
