Innovating R Tree to Create Summary Filter for Message Forwarding Technique in Service-Based Routing-Reference-Cited by-同舟云学术

Innovating R Tree to Create Summary Filter for Message Forwarding Technique in Service-Based Routing

Published:2013 Issue: Volume: Page:178-188
ISSN:1867-8211
Container-title:Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
language:
Short-container-title:

Author:

Long Nguyen Thanh,Thuy Nguyen Duc,Hoang Pham Huy,Chien Tran Dinh

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-41773-3_19

Reference6 articles.

1. Robmson, J.T.: The K-D-B Tree A Search Structure for Large Multldimenslonal Dynarmc Indexes. In: 4CM-SIGMOD Conference Proc., April 10-18 (1981)

2. Guttman, A.: R-Trees - A Dynamic Index Structure for Spatial Searching, University of California Berkeley

3. Guttman, A., Stonebraker, M.: Using a Relational Database Management System for Computer Added Design Data. IEEE Database Engineering 5(2) (June 1982)

4. Yuval, G.: Finding Near Neighbors in k-dimensional Space. Inf. Proc. Lett. 3(4), 113–114 (1975)

5. LNICST;N.T. Long,2013

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

1. Innovating Based on R tree and Artificial Neural Network for Hierarchical Clustering in Order to Make QoS Routes in MANET;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2017-10-10

2. Innovating R Tree and Multicast Routing to Make QOS Multiple Paths for Service Based Routing;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2016

3. Building Multiple Multicast Trees with Guarranteed QOS for Service Based Routing Using Artificial Algorithms;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2016