CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Developing Xquery Model for Distributed Query Processing in Mobile Networks

by T.P.Andamuthu, P.Balasubramanie
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 25 - Number 4
Year of Publication: 2011
Authors: T.P.Andamuthu, P.Balasubramanie
10.5120/3018-4082

T.P.Andamuthu, P.Balasubramanie . Developing Xquery Model for Distributed Query Processing in Mobile Networks. International Journal of Computer Applications. 25, 4 ( July 2011), 36-41. DOI=10.5120/3018-4082

@article{ 10.5120/3018-4082,
author = { T.P.Andamuthu, P.Balasubramanie },
title = { Developing Xquery Model for Distributed Query Processing in Mobile Networks },
journal = { International Journal of Computer Applications },
issue_date = { July 2011 },
volume = { 25 },
number = { 4 },
month = { July },
year = { 2011 },
issn = { 0975-8887 },
pages = { 36-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume25/number4/3018-4082/ },
doi = { 10.5120/3018-4082 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:10:54.187838+05:30
%A T.P.Andamuthu
%A P.Balasubramanie
%T Developing Xquery Model for Distributed Query Processing in Mobile Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 25
%N 4
%P 36-41
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The emergence and popularity of mobile computing environment, so get a variety of semi-structured data to follow some common XML model. The Extensible Markup Language (XML) model has recently gained huge popularity because of its ability to represent a wide variety of structured and semi-structured data. Several Query languages have been proposed for the XML data model, the most-widely known is XQuery. Traditional query processing to a database focused on structured data retrieval and structures to support them. In this paper we present a model and an algorithm for querying structured and semi - structured data for mobile computing environments based on the model of XQuery. We employ a variety of servers to handle different jobs. Buffer is maintained in the mobile node and the cache is stored in the query server, and mobile server. Priority is given to requests based on various parameters such as priority by the user, the required bandwidth, etc. parameters considered for performance measure of the effectiveness of the request, delivery ratio and average power consumption and the results show that the proposed algorithm works better than existing systems.

References
  1. Agrawal R., S. Dat and H. Jagadish,(1990)“Direct Transitive ClosureAlgorithms:DesignandPerformanceEvaluation,” ACM Trans. Database Sys, Vol. 15, No. 3,pp. 427-458,.
  2. Bancilhon.F,(1998) “Object-oriented Database Systems,” Proc. ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Austin, Texas.
  3. Bray.T,(2004) “Extensible Markup Language (XML) 1.0(Third Edition),” W3C Recommendation.
  4. Cod, E.F (1970) “A Relational Model of Data for Large Shared Data-banks,” Comm. Of ACM, Vol. 13, No. 1, pp. 377-387.
  5. Dewitt D and D. Schneider,(1989)“A Performance Evaluation of Four Parallel Join Algorithms in a Shared-nothing Multiprocessor Environment,” Proceedings of ACM Conference on Management of Data (SIGMOD).
  6. Gallaire.H, J. Minker, and J. M. Nicolas,( 1984) “Logic and Databases: A Deductive Approach,” ACM Computing Surveys, Vol. 16, No. 2.
  7. Jae-Gil Lee , Kyu-Young Whang, (2006) “Secure query processing against encrypted XML data using Query-Aware Decryption”.
  8. Maged El-Sayed , Katica Dimitrova , Elke A. Rundensteiner, (2005) “Efficiently supporting order in XML query processing”. Elsevier- Data & Knowledge Engineering, pp. 355–390.
  9. Qadah G. Z. and K. B. Irani,(1988) “The Join Algorithms on a Shared – memory Multiprocessor Database Machine,”IEEE Transactions on Software Engineering, Vol. 14, No. 11, pp. 1668-1683.
  10. Qadah G. Z, L. J. Henschen and J. Kim,(1991) “EfficientAlgorithms for the Instantiated Transitive ClosureQueries,” IEEE Transaction on Software Engineering, Vol. 17, No. 3, pp. 296 – 309.
  11. Qadah G. Z. and J. Kim, (1992) “The processing of a class oftransitive closure queries on uniprocessor and sharednothing multiprocessor systems,” Data & KnowledgeEngineering, pp. 57 – 89.
  12. D.Saha and N. Chowdhury, “A Method for Secure Query Processing in Mobile Databases”, International Association of Engineers, Volume 14, Issue 1, Engineering Letters, 14:1, EL_14_1_20, February 2007.
  13. Tabassum K, Hijab M, Damodaram A, “Location Dependent Query Processing – Issues, Challenges and Applications”, International Conference on Computer and Network and Technology (ICCNT), April 2010, pp: 239 – 243. DOI: 10.1109/ICCNT.2010.39
  14. T. P. Andamuthu and Dr. P. Balasubramine, “A Delay-Tolerant Distributed Query Processing Architecture for Mobile Environment”, International Journal of Computer and Information Engineering, volume 4, issue 2, 2010, pp: 86 – 90.
  15. S. Acharya, R. Alonso, M. Franklin, and S. Zdonik. “Broadcast Disks: Data Management for Asymmetric Communication Environments.” Proceedings of ACM SIGMOD Conference, San Jose, CA, May 1995.
  16. S. Acharya, M. Franklin, and S. Zdonik. “Balancing Push and Pull for Data Broadcast.” Proceedings of ACM SIGMOD Conference, Phoenix, AZ, May 1997.
  17. Dorian C. Arnold Barton P. Miller “A Scalable Failure Recovery Model for Tree-based Overlay Networks”, 2007 ACM.
  18. D. Stojanović et al. "Continuous Range Query Processing for Network Constrained Mobile Objects", Proceedings of the 8th International Conference on Enterprise Information Systems (ICEIS 2006), May 24- 27, Paphos, Cyprus, 2006, pp. 63-70.
  19. Wei-Shinn Ku “Privacy Protected Query Processing on Spatial Networks”, 2007 IEEE 23rd International Conference on Data Engineering Workshop, April 2007.
  20. Giuseppe Amato et al. “Enabling Context Awareness through Distributed Query Processing in Wireless Sensor Networks”, 2nd International Workshop on Requirements and Solutions for Pervasive Software infrastructures, September 16, 2007, Innsbruck, Austria.
  21. Sandeep Prakash , Sourav S. Bhowmick , Sanjay Madria b, (2006) “Efficient recursive XML query processing using relational database systems”. Elsevier-Data & Knowledge Engineering ,pp.207–242.
  22. Shapiro D. I.,(1986) “Join Processing in Database Systems with Large Main Memories,” ACM Trans. Database Sys, Vol. 11, No. 3, pp. 239-264.
  23. Toroslu, I. H. and Qadah, G. Z.,(1996) “The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation,” IEEE Transaction on Knowledge and Data Engineering, VOL. 8, NO. 4,pp. 617 – 629.
  24. Guilherme Figueiredo, Vanessa Braganholo and Marta Mattoso, “A Methodology for Query Processing over Distributed XML Databases”, www.dcc.ufrj.br/~braganholo/artigos/RT-guilherme.pdf
Index Terms

Computer Science
Information Sciences

Keywords

Query Processing Mobile computing cache query efficiency etc

Powered by PhDFocusTM