Ub-Tree Indexing For Semantic Query Optimization Of Range Queries

S. Housseno, A. Simonet, M. Simonet
2009 Zenodo  
Semantic query optimization consists in restricting the search space in order to reduce the set of objects of interest for a query. This paper presents an indexing method based on UB-trees and a static analysis of the constraints associated to the views of the database and to any constraint expressed on attributes. The result of the static analysis is a partitioning of the object space into disjoint blocks. Through Space Filling Curve (SFC) techniques, each fragment (block) of the partition is
more » ... ssigned a unique identifier, enabling the efficient indexing of fragments by UB-trees. The search space corresponding to a range query is restricted to a subset of the blocks of the partition. This approach has been developed in the context of a KB-DBMS but it can be applied to any relational system.
doi:10.5281/zenodo.1079716 fatcat:nnd37mb4orh35hpft76k66icsu