1 / 17

Managing Server-Based Data for Location-Aware Mobile Business Applications

This paper explores the management of server-based data supporting location-based m-business applications. It discusses the critical concept of location awareness in mobile transactions, emphasizing its importance for creating value in various applications. The paper addresses the challenges of proximity queries in conventional data management methods and introduces the Location-Aware Linkcell Method. By transforming geographical positions into linkcells, it significantly improves the efficiency of proximity queries, allowing businesses to optimize their services based on users' locations.

hertz
Télécharger la présentation

Managing Server-Based Data for Location-Aware Mobile Business Applications

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Meanwhile ... back at the server Managing Server-Based Data in Support of the Location-Based m-Business Applications of Location-Variant Mobile UsersJim Wyse7th World Congress on the Management of e-Business (2006)

  2. m-Business Environment

  3. Mobile Business (m-Business) • transactions through communication channels that permit a high degree of mobility by at least one of the transactional parties.

  4. Location-Based m-Business • m-business with location-referent transactions: transactions in which the geographical proximity of the transactional parties is a material transactional consideration. • Critical capability: location awareness. • Yuan and Zhang (2003): “location awareness … is a new dimension for value creation” in a wide variety mobile business applications.

  5. Location Aware Capability • The capability to obtain and use the geo-positions of the transactional parties to perform one or more of the CRUD (create, retrieve, update, delete) functions of data management (Butz, Baus, and Kruger 2000) in support of location-referent transactions.

  6. The Data Management Problem • Location-referent transactions are supported by proximity queries: What is my proximity to a goods-providing (or service-offering) location in a selected category? • A proximity query bears criteria that reference static attributes (e.g., hospital) and dynamic attributes (e.g., nearest). • Proximity queries are burdensome to conventional query resolution approaches (Nievergelt and Widmayer, 1997).

  7. Proximity Query Resolution: Proximity Portals The i-DAR Prototype

  8. The Problem (. . . and a Solution?)

  9. LinkcellsGeographical Space  Relational Space

  10. Location-Aware Linkcell Method • Transforms mu’s position (47.523° N, 119.137° W) into a linkcell (N47W119). • Initiates search sequence at mu’s linkcell {N48W119, N48W118, N47W118, N46W118, ….} • Permits large numbers of locations to be excluded as proximity portal candidates. • Requires an appropriate linkcell ‘size’ to give superior performance.

  11. Figure 4 100,000-Location SCR – Brute Force Results c-effect n-effect

  12. Optimal Linkcell Size Solve …. PTC(S) = 1 – (1 – nTC/N)N/CS 0.6 . . . (A) . . . . for Linkcell “Name Increments” nTC is the number of locations in category, TC, N is total number of locations, and CS is the number of linkcells of size, S, created from the N locations.

  13. MCRs and SCRs • Multiple Category Repositories (MCRs) • Single Category Repositories (SCRs) • Equation (A) applies to MCRs but not to SCRs • For SCRs, nTC = N  PTC(S) = 1, for all S.

  14. Single Category Repositories (SCRs) • For SCRs, it is hypothesized that • P(S) = 1 – (1 – S2/4A)N 0.6 . . . (B) • will yield optimal values, where • A is the entire geographical area covered by the repository, • S is the linkcell size, and • N is the number of locations. • Some preliminary results ……

  15. Figure 6

  16. Critical Area for Further Work • Uniform locational distributions assumed • Businesses often locate or co-locate in non-uniform ways: • - pharmacies next to medical clinics • - law firms in legal ‘districts’ • - retail petroleum outlets near highway intersections. • - etc.

  17. Jim Wysewww.busi.mun.ca/jwyse Conference Paper Data Management for Location-Based Mobile Business Applications: The Location-Aware Linkcell Method

More Related