메뉴 건너뛰기




Volumn 28, Issue 4, 2016, Pages 925-938

Distributed In-Memory Processing of All k Nearest Neighbor Queries

Author keywords

All kNN queries; data replication; main memory processing; shared nothing architectures; space partitioning

Indexed keywords

ALGORITHMS; BATCH DATA PROCESSING; EFFICIENCY; MOTION COMPENSATION; NEAREST NEIGHBOR SEARCH; PARTITIONS (BUILDING); SCALABILITY;

EID: 84963728902     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2015.2503768     Document Type: Article
Times cited : (24)

References (30)
  • 2
    • 0036606530 scopus 로고    scopus 로고
    • A framework for generating network-based moving objects
    • T. Brinkhoff, "A framework for generating network-based moving objects, " Geoinformatica, vol. 6, pp. 153-180, 2002.
    • (2002) Geoinformatica , vol.6 , pp. 153-180
    • Brinkhoff, T.1
  • 3
    • 0027842562 scopus 로고
    • Optimal parallel all-nearest-neighbors using the well-separated pair decomposition
    • P. B. Callahan, "Optimal parallel all-nearest-neighbors using the well-separated pair decomposition, " in Proc. 34th IEEE Annu. Found. Comput. Sci., 1993, pp. 332-340.
    • (1993) Proc. 34th IEEE Annu. Found. Comput. Sci. , pp. 332-340
    • Callahan, P.B.1
  • 5
    • 34548749756 scopus 로고    scopus 로고
    • Efficient evaluation of all-nearest-neighbor queries
    • Y. Chen and J.M. Patel, "Efficient evaluation of all-nearest-neighbor queries, " in Proc. 23rd IEEE Int. Conf. Data Eng., 2007, pp. 1056-1065.
    • (2007) Proc. 23rd IEEE Int. Conf. Data Eng. , pp. 1056-1065
    • Chen, Y.1    Patel, J.M.2
  • 9
    • 0030496241 scopus 로고    scopus 로고
    • Scalable parallel computational geometry for coarse grained multicomputers
    • F. Dehne, A. Fabri, and A. Rau-Chaplin, "Scalable parallel computational geometry for coarse grained multicomputers, " Int. J. Comput. Geometry, vol. 6, pp. 379-400, 1996.
    • (1996) Int. J. Comput. Geometry , vol.6 , pp. 379-400
    • Dehne, F.1    Fabri, A.2    Rau-Chaplin, A.3
  • 15
    • 0030212379 scopus 로고    scopus 로고
    • Constructing euclidean minimum spanning trees and all nearest neighbors on reconfigurable meshes
    • Aug.
    • T. H. Lai and M.-J. Sheng, "Constructing euclidean minimum spanning trees and all nearest neighbors on reconfigurable meshes, " IEEE Trans. Parallel Distrib. Syst., vol. 7, no. 8, pp. 806-817, Aug. 1996.
    • (1996) IEEE Trans. Parallel Distrib. Syst. , vol.7 , Issue.8 , pp. 806-817
    • Lai, T.H.1    Sheng, M.-J.2
  • 21
    • 33846464687 scopus 로고    scopus 로고
    • Distributed computation of the Knn graph for large High-dimensional point sets
    • E. Plaku and L. E. Kavraki, "Distributed computation of the Knn graph for large High-dimensional point sets, " J. Parallel Distrib. Comput., vol. 67, no. 3, pp. 346-359, 2007.
    • (2007) J. Parallel Distrib. Comput. , vol.67 , Issue.3 , pp. 346-359
    • Plaku, E.1    Kavraki, L.E.2
  • 24
    • 0000662711 scopus 로고
    • An o(n log n) algorithm for the All-nearest-neighbors problem
    • P. M. Vaidya, "An o(n log n) algorithm for the All-nearest-neighbors problem, " Discrete Comput. Geometry, vol. 4, pp. 101-115, 1989.
    • (1989) Discrete Comput. Geometry , vol.4 , pp. 101-115
    • Vaidya, P.M.1
  • 26
    • 77952749478 scopus 로고    scopus 로고
    • K nearest neighbor queries and kNNjoins in large relational databases (almost) for free
    • B. Yao, F. Li and P. Kumar, "K nearest neighbor queries and kNNjoins in large relational databases (almost) for free, " in Proc. 26th IEEE Int. Conf. Data Eng., 2010, pp. 4-15.
    • (2010) Proc. 26th IEEE Int. Conf. Data Eng. , pp. 4-15
    • Yao, B.1    Li, F.2    Kumar, P.3
  • 30
    • 57349138263 scopus 로고    scopus 로고
    • Learning transportation mode from raw GPS data for geographic applications on the web
    • Y. Zheng, L. Liu, L. Wang, and X. Xie, "Learning transportation mode from raw GPS data for geographic applications on the web, " in Proc. 17th Int. Conf. World Wide Web, 2008, pp. 247-256.
    • (2008) Proc. 17th Int. Conf. World Wide Web , pp. 247-256
    • Zheng, Y.1    Liu, L.2    Wang, L.3    Xie, X.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.