Skip Navigation

The Computer Journal 2003 46(6):713-725; doi:10.1093/comjnl/46.6.713
© 2003 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Theodoridis, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Ten Benchmark Database Queries for Location-based Services

Yannis Theodoridis1,2

1 Department of Informatics, University of Piraeus, GR-18534 Piraeus, Greece Email: ytheod@unipi.gr 2 Also with the Data and Knowledge Engineering Group, Computer Technology Institute.

Location-based services (l-services for short) comprise an emerging application involving spatiotemporal databases. In this paper, we discuss this type of application in terms of database requirements and provide a set of ten benchmark database queries (plus two operations for loading and updating data). The list includes selection queries on stationary and moving reference objects, join queries and unary operations on trajectories of moving objects. We also survey recent work in query processing for those query types, with an emphasis on indexing moving objects, and suggest candidates for efficiently supporting databases for l-services.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.