{"title":"多键搜索的动态查询范围","authors":"Xian-He Sun, N. Kamel","doi":"10.1109/CMPSAC.1990.139338","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic query range for multikey searching\",\"authors\":\"Xian-He Sun, N. Kamel\",\"doi\":\"10.1109/CMPSAC.1990.139338\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":127509,\"journal\":{\"name\":\"Proceedings., Fourteenth Annual International Computer Software and Applications Conference\",\"volume\":\"83 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings., Fourteenth Annual International Computer Software and Applications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.1990.139338\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1990.139338","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.<>