Effective protocols for kNN search on broadcast multi-dimensional index trees

Information Systems

Volumn 33, Issue 1, 2008, Pages 18-35

  Liu, Chuan Ming ^a   Fu, Shu Yu ^a  

^a NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Data dissemination; kNN search; Latency; Memory usage; Multi dimensional index trees; Tuning time

Indexed keywords

ALGORITHMS; BROADCASTING; DATA ACQUISITION; MOBILE COMPUTING; NETWORK PROTOCOLS; SEARCH ENGINES; SERVERS; TUNING;

DATA DISSEMINATION; MEMORY USAGE; MULTI DIMENSIONAL INDEX TREES; WIRELESS ENVIRONMENTS;

INDEXING (OF INFORMATION);

EID: 35949001269     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2007.04.002     Document Type: Article

References (32)

1. S. Acharya, R. Alonso, M. Franklin, S. Zdonik, Broadcast disks: data management for asymmetric communication environments, in: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 1995, pp. 199-210.
2. S. Acharya, M. Franklin, S. Zdonik, Balancing push and pull for data broadcast, in: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, 1997, pp. 183-194.
3. Jing J., Helal A.S., and Elmagarmid A. Client-server computing in mobile environments. ACM Comput. Surv. 31 2 (1999) 117-157
4. T. Imielinski, S. Viswanathan, B.R. Badrinath, Energy efficient indexing on air, in: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, 1994, pp. 25-36.
5. Shivakumar N., and Venkatasubramanian S. Efficient indexing for broadcast based wireless systems. Mobile Networks Appl. 1 4 (1996) 433-446
6. Hambrusch S., Liu C.-M., Aref W.G., and Prabhakar S. Efficient query execution on broadcasted index tree structures. Data Knowledge Eng. 60 3 (2007) 511-529
7. Hambrusch S., Liu C.-M., and Prabhakar S. Broadcasting and querying multi-dimensional index trees in a multi-channel environment. Inf. Syst. 31 8 (2006) 870-886
8. S.E. Hambrusch, C.-M. Liu, W.G. Aref, S. Prabhakar, Query processing in broadcasted spatial index trees, in: Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases, Springer-Verlag, 2001, pp. 502-521.
9. Imieliński T., Viswanathan S., and Badrinath B.R. Data on air: organization and access. IEEE Trans. Knowledge Data Eng. 9 3 (1997) 353-372
10. Khanna S., and Zhou S. On indexed data broadcast. J. Comput. Syst. Sci. 60 3 (2000) 575-591
11. C.-M. Liu, Broadcasting and blocking large data sets with an index tree, Ph.D. Thesis, Purdue University, West Lafayette, IN, 2002.
12. Yu J.X., and Tan K.-L. An analysis of selective tuning schemes for nonuniform broadcast. Data Knowledge Eng. 22 3 (1997) 319-344
13. J. Zhang, L. Gruenwald, Optimizing data placement over wireless broadcast channel for multi-dimensional range query processing, in: Proceedings of the 5th IEEE International Conference on Mobile Data Management (MDM 2004), 2004, pp. 256-265.
14. Zheng B., Lee W.-C., and Lee D.L. Spatial queries in wireless broadcast systems. Wireless Networks 10 6 (2004) 723-736
15. N. Roussopoulos, S. Kelley, F. Vincent, Nearest neighbor queries, in: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 1995, pp. 71-79.
16. A. Guttman, R-trees: a dynamic index structure for spatial searching, in: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, 1984, pp. 47-57.
17. B. Gedik, A. Singh, L. Liu, Energy efficient exact knn search in wireless broadcast environments, in: Proceedings of the 12th Annual ACM International Workshop on Geographic Information Systems, 2004, pp. 137-146.
18. Gaede V., and Günther O. Multidimensional access methods. ACM Comput. Surv. 30 2 (1998) 170-231
19. *-tree: an efficient and robust access method for points and rectangles, in: Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, 1990, pp. 322-331.
20. M. Franklin, S. Zdonik, A framework for scalable dissemination-based systems, in: OOPSLA '97 Conference Proceedings: Object-Oriented Programming Systems, Languages, and Applications, 1997, pp. 94-105.
21. Hameed S., and Vaidya N.H. Efficient algorithms for scheduling data broadcast. Wireless Networks 5 3 (1999) 183-193
22. H.-P. Hung, M.-S. Chen, On exploring channel allocation in the diverse data broadcasting environment, in: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 2005, pp. 729-738.
23. Su C.-J., Tassiulas L., and Tsotras V.J. Broadcast scheduling for information distribution. ACM/Baltzer J. Wireless Network 5 2 (1999) 137-147
24. B. Zheng, X. Wu, X. Jin, D.L. Lee, Tosa: a near-optimal scheduling algorithm for multi-channel data broadcast, in: Proceedings of the 6th International Conference on Mobile Data Management, 2005, pp. 29-37.
25. Bar-Noy A., Naor J., and Schieber B. Pushing dependent data in clients-providers-servers systems. Wireless Networks 9 (2003) 421-430
26. J.-L. Huang, M.-S. Chen, W.-C. Peng, Broadcasting dependent data for ordered queries without replication in a multi-channel mobile environment, in: Proceedings of the 19th International Conference on Data Engineering, 2003, pp. 692-694.
27. A.R. Hurson, Y. Jiao, Data broadcasting in a mobile environment, in: Wireless Information Highway, IRM Press, 2004, pp. 96-154, (Chapter 4).
28. C.-M. Liu, K.-F. Lin, Disseminating dependent data in wireless broadcast environments, Distributed Parallel Databases, available on-line, January 2007.
29. K.-F. Lin, C.-M. Liu, Schedules with minimized access latency for disseminating dependent information on multiple channels, in: Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC 2006), vol. 1, 2006, pp. 344-351.
30. C.-M. Liu, K.-F. Lin, Efficient scheduling algorithms for disseminating dependent data in wireless mobile environments, in: Proceedings of the IEEE 2005 International Conference on Wireless Networks, Communications and Mobile Computing (WirelessCom 2005), 2005, pp. 375-380.
31. Zheng B., Xu J., Lee W.-C., and Lee L. Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services. VLDB J. 15 1 (2006) 21-39
32. Xu J., Zheng B., Lee W.-C., and Lee D.L. The D-tree: an index structure for planar point queries in location-based wireless services. IEEE Trans. Knowledge Data Eng. 16 12 (2004) 1526-1542