Title :
Dynamic query range for multikey searching
Author :
Sun, Xian-He ; Kamel, Nabil N.
Author_Institution :
Dept. Comput. Sci., Michigan State Univ., East Lansing, MI, USA
fDate :
31 Oct-2 Nov 1990
Abstract :
The use of range searching data structures for general multikey PROJECT-SELECT-JOIN queries is studied. A dynamic query range concept is introduced as a means for performing range searches in kd-trees when the search range contains multi-variable comparisons. A full implementation is described and test results are presented. Thus, through searching on the dynamic query ranges, the general PROJECT-SELECT-JOIN query implementation is facilitated in large databases
Keywords :
data structures; database management systems; query languages; trees (mathematics); dynamic query range; general PROJECT-SELECT-JOIN query; kd-trees; multikey searching; range searching data structures; Books; Computer science; Data structures; Databases; Dynamic range; Query processing; Sun; Testing; Tree data structures; Upper bound;
Conference_Titel :
Computer Software and Applications Conference, 1990. COMPSAC 90. Proceedings., Fourteenth Annual International
Conference_Location :
Chicago, IL
Print_ISBN :
0-8186-2054-4
DOI :
10.1109/CMPSAC.1990.139338
