Applying Location-Aware Linkcell-Based Data Management to Context-Aware Mobile Business Services

Providing location-aware services to mobile users comes with an inherent service-degrading data management problem for which the location-aware linkcell-based data management method was developed as a solution. Context-aware services are often viewed as generalizations of location-aware services; thus, many context-aware application systems necessarily inherit the data management problems associated with any subsumed location- aware subsystems. Despite their potential to solve these problems, linkcell-based methods have not been previously examined for use in context-aware applications. This article explores how linkcell-based methods may be incorporated into context-aware applications to support the provision of context-aware services to mobile business users. The article begins by reviewing the essentials of linkcell-based data management. Next it decomposes a prototypical context-aware system into its essential components and then contemplates how the linkcell method may be reformulated to support the data management requirements associated with providing context-aware mobile business services.

[1]  James E. Wyse.  Location-Aware Query Resolution for Location-Based Mobile Commerce: Performance Evaluation and Optimization , 2006, J. Database Manag..

[2]  D. Lee,et al.  Computational Geometry Ii , 2007 .

[3]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[4]  Louise Barkhuus,et al.  Context Information vs . Sensor Information : A Model for Categorizing Context in Context-Aware Mobile Computing , 2002 .

[5]  Seng Wai Loke,et al.  Implementing context-aware regulation of context-aware mobile services in pervasive computing environments , 2006, Int. J. Web Grid Serv..

[6]  Hanan Samet,et al.  Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems , 1999, Algorithmica.

[7]  Peter Widmayer,et al.  Spatial Data Structures: Concepts and Design Choices , 1996, Algorithmic Foundations of Geographic Information Systems.

[8]  E. F. Codd,et al.  A Relational Model for Large Shared Data Banks , 1970 .

[9]  Matthew Cary,et al.  Towards Optimal ǫ-Approximate Nearest Neighbor Algorithms in Constant Dimensions , 2001 .

[10]  Matthias Baldauf,et al.  A survey on context-aware systems , 2007, Int. J. Ad Hoc Ubiquitous Comput..

[11]  Yufei Yuan,et al.  Towards an appropriate business model for m-commerce , 2003, Int. J. Mob. Commun..

[12]  Ofir Turel,et al.  Contextual effects on the usability dimensions of mobile value-added services: a conceptual framework , 2006, Int. J. Mob. Commun..

[13]  E. P. Michael.  Strategy and the Internet. , 2001 .

[14]  Hanan Samet,et al.  Efficient regular data structures and algorithms for location and proximity problems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[15]  James E. Wyse.  Supporting m-commerce transactions incorporating locational attributes: an evaluation of the comparative performance of a location-aware method of locations repository management , 2003, Int. J. Mob. Commun..

[16]  Matthew Cary.  Toward Optimal epsilon-Approximate Nearest Neighbor Algorithms , 2001, J. Algorithms.

[17]  James E. Wyse.  Optimising server performance for location-aware client applications in mobile commerce: the repository manager's formula , 2009, Int. J. Wirel. Mob. Comput..