Spatial join method and apparatus
作者： Curt J. Ellmann , Gang Luo , Jeffrey F. Naughton
DOI:
关键词:
摘要: A non-blocking parallel spatial join algorithm generates the result tuples continuously even in event of memory overflow. The employs duplicate avoidance techniques to avoid blocking and time-consuming removal duplicates. also uses parallelism improve performance.
google.de 参考文章(41)
Joseph M. Hellerstein, Online Processing Redux. IEEE Data(base) Engineering Bulletin. ,vol. 20, pp. 20- 29 ,(1997)
Michael William Freeston, Computer data storage management system and methods of indexing a dataspace and searching a computer memory ,(1994)
Nimrod Megiddo, Uri Shaft, Method for computing near neighbors of a query point in a database ,(1997)
John Christopher Shafer, Rakesh Agrawal, Method and system for performing proximity joins on high-dimensional data points in parallel ,(1997)
David Mun-Hien Choy, Data partitioning by co-locating referenced and referencing records ,(1997)
Michael W. Martin, Interval-partitioning method for multidimensional data ,(1998)
Beng Chin Ooi, Kian-Lee Tan, Cheng Hian Goh, Online Feedback for Nested Aggregate Queries with Multi-Threading very large data bases. pp. 18- 29 ,(1999)
David J. DeWitt, Jie-Bing Yu, Jignesh M. Patel, Jun Luo, Navin Kabra, Client-Server Paradise very large data bases. pp. 558- 569 ,(1994)
Miron Livny, HweeHwa Pang, Michael J. Carey, Memory-Adaptive External Sorting very large data bases. pp. 618- 629 ,(1993)
Amol Deshpande, Joseph M. Hellerstein, Vijayshankar Raman, Samuel Madden, Mehul A. Shah, Sirish Chandrasekaran, Michael J. Franklin, Kris Hildrum, Adaptive Query Processing: Technology in Evolution. IEEE Data(base) Engineering Bulletin. ,vol. 23, pp. 7- 18 ,(2000)