Supporting m-commerce transactions incorporating locational attributes: an evaluation of the comparative performance of a location-aware method of locations repository management

International Journal of Mobile Communications

Volumn 1, Issue 1-2, 2003, Pages 119-147

  Wyse, James E ^a  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

Location aware database management; location based systems; locations repository management; mobile commerce

Indexed keywords

EID: 13144280722     PISSN: 1470949X     EISSN: 17415217     Source Type: Journal    
DOI: 10.1504/ijmc.2003.002462     Document Type: Article

References (20)

1. Schneider, G.P. and Perry, J.T. (2001) Electronic Commerce, 2nd ed., Nelson/Thomson Learning.
2. Lahey, L. (2001) ‘M-commerce faces many hurdles: study’, ComputerWorld Canada, 12 January, p.6.
3. The notion of location awareness used in this report is consistent with that put forth by Butz, Baus, and Kruger [4] in their description of location aware devices: “The main principle is, that the device has information of some sort about its position in space and can then retrieve, filter or present information appropriate to this position. This paradigm puts the mobile device in charge of a) determining its position and b) selecting, retrieving and displaying the appropriate information.”
4. Butz, A., Baus, J. and Kruger, A. (2000) ‘Different views on location awareness’, 3pp. 20 Dec. 2001, http://www.coli.uni-sb.de/sfb/publications/butzetal2000d-de.html
5. Other workable cell constructions may use other than the integral values of the coordinate system. Using coordinate ‘tenths’ could also be used to construct the required cells, in which case the cell name for Si would be H075V023.
6. Kottkamp, H-E. and Zukunft, O.(1998) ‘Location-aware query processing in mobile database systems’, Selected Areas in Cryptography, pp. 416-423, http://citeseer.nj.nec.com/114151.html
7. Ward, A., Jones, A. and Hopper, A. (1997) ‘A new location technique for the active office’, IEEE Personnel Communications, Vol. 4, No. 5, October, pp. 42-47. http://citeseer.nj.nec.com/ward97new.html
8. The number of category-qualified sites appearing in a resultset will never exceed the number of category-qualified sites contained in the repository. Thus, both the intermediate and final resultsets of an N-Query will contain fewer than N sites whenever the repository contains fewer than N sites.
9. The methods were implemented as VB subroutines incorporating ActiveX Data Objects and embedded SQL commands. Repositories, linkcells, and resultsets were implemented as relational tables in a SQL Server 7 database.
10. Although a specific map projection technique underlies these coordinates, Method-β was purposely developed and described without reference to any map projection method. An implementation of Method-β in an actual m-commerce setting would likely be based on a specific map projection technique. This would require that projection-related adjustments be made to the method such as those required by distance determinations (adjustments which had to be incorporated into the specific implementation of Method-β used for the simulations conducted here).
11. The use of the term ‘distance units’ throughout this report is intended to convey the unit-independent nature of Method-β. Given the coordinate system used for the simulations conducted here, all distances are in nautical miles. However, there is nothing associated with the procedural components of Method-β or Method-α that would preclude the use of other units of distance.
12. Samet, H. (1990) Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley Publishing Company, Reading, Massachusetts.
13. Lee, D.T. (1999) ‘Computational geometry II’, in J.M. Atallah (Ed.) Algorithms and Theory of Computation Handbook, CRC Press, New York, New York, pp.20-1 to 20-31.
14. Arnon, A., Alon E., Piotr I. and Hanan, S. (1999) ‘Efficient regular data structures and algorithms for location and proximity problems’, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York, New York, 17-19 October, pp.160-170.
15. Cary, M. (2000) ‘Towards optimal ε-approximate nearest neighbour algorithms in constant dimensions’, 12pp. 22 Dec. 2001, http://citeseer.nj.nec.com/408932.html, (forthcomong), Journal of Algorithms.
16. Kuznetsov, V.E. (1997) ‘Method for storing map data in a database using space filling curves and a method of searching the database to find objects in a given area and to find objects nearest to a location’, United States Patent, Number 6,021,406, filed 14 Nov. 1997.
17. Sierpinski, W. (1912) ‘Sur une novelle courbe continue qui remplit toute une aire plaine’, Bulletin International De L’Academie Des Sciences de Cracovie, Ser. A., pp.462-478.
18. Butz, A.R. (1969) ‘Convergence with Hilbert’s space-filling curve’, Journal of Computer and System Sciences, Vol. 3, pp.128-146.
19. Butz, A.R. (1971) ‘Alternative algorithm for Hilbert’s space-filling curve.’ IEEE Transactions on Computers, Apr., pp.424-426.
20. Musk, E., Wai, K-S. and Chan, L. (1998) ‘Method and apparatus for an accelerated radius search’, United States Patent, Number 6,018,650, filed 21 Aug. 1998.