On k-d Range Search with Patricia Tries
暂无分享,去创建一个
[1] Oliver Günther,et al. Multidimensional access methods , 1998, CSUR.
[2] Bradford G. Nickerson,et al. Multidimensional Orthogonal Range Search Using Tries , 2003, CCCG.
[3] Bradford G. Nickerson,et al. Approximate Orthogonal Range Search using Patricia Tries , 2005, CCCG.
[4] Jon Louis Bentley,et al. Data Structures for Range Searching , 1979, CSUR.
[5] Luc Devroye,et al. Analysis of range search for random k-d trees , 2001, Acta Informatica.
[6] Chak-Kuen Wong,et al. Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees , 1977, Acta Informatica.
[7] Bradford G. Nickerson,et al. Tries for combined text and spatial data range search , 2004, CCCG.
[8] Hanan Samet,et al. Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.
[9] Sunil Arya,et al. Approximate range searching , 1995, SCG '95.
[10] Wojciech Szpankowski,et al. Patricia tries again revisited , 1990, JACM.
[11] Bradford G. Nickerson,et al. k-d Range Search with Binary Patricia Tries , 2004 .
[12] Donald R. Morrison,et al. PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.
[13] Bernard Chazelle,et al. Lower bounds for orthogonal range searching: part II. The arithmetic model , 1990, JACM.
[14] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .
[15] Divesh Srivastava,et al. On effective multi-dimensional indexing for strings , 2000, SIGMOD '00.
[16] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[17] Helmut Prodinger,et al. Multidimensional Digital Searching-Alternative Data Structures , 1994, Random Struct. Algorithms.