The Design Perspective of the Structures Based on k-d Tree-Reference-Cited by-同舟云学术

The Design Perspective of the Structures Based on k-d Tree

Published:2020-10-02 Issue: Volume: Page:515-524
ISSN:2194-5357
Container-title:Rising Threats in Expert Applications and Solutions
language:
Short-container-title:

Author:

Gill Sumeet,Hooda Meenakshi

Publisher

Springer Singapore

Link

http://link.springer.com/content/pdf/10.1007/978-981-15-6014-9_61

Reference14 articles.

1. J.T. Robinson, The K-D-B tree: a search structure for large multidimensional dynamic indexes, Ann Arbor, MI: Proceeding 1981 ACM-SIGMOD International Conference on Management of Data (1981), pp. 10–18

2. T. Matsuyama, L. Hao, M. Nagao, A file organization for geographic information systems based on spatial proximity, ScienceDirect. Comput. Vis. Graphics Image Process. 26, 303–318 (1984)

3. J. Dittrich, L. Blunschi, M.A. Vaz Salles, Indexing moving objects using short-lived throwaway indexes, in Advances in Spatial and Temporal Databases, vol. 5644 (Springer, Berlin, Heidelberg, 2009), pp. 189–207

4. H. Doraiswamy, A GPU-based index to support interactive spatio-temporal queries over historical data, in IEEE, IEEE 32nd International Conference on Data Engineering, Helsinki, Finland (2016)

5. P. Wu, Randomly projected KD-trees with distance metric learning for image retrieval, in International Conference on Multimedia Modeling, Advances in Multimedia Modeling, vol. 6524, Springer, Berlin, Heidelberg (2011), pp. 371–382

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimizing Taxi Route Planning Based on Taxi Trajectory Data Analysis;Lecture Notes in Computer Science;2023-11-07

2. Locally-Adaptive Naïve Bayes Framework Design via Density-Based Clustering for Large Scale Datasets;Handbook of Research on Machine Learning Techniques for Pattern Recognition and Information Security;2021