IDEAS home Printed from https://ideas.repec.org/a/wsi/ijitdm/v09y2010i03ns0219622010003853.html
   My bibliography  Save this article

Assignment Query And Its Implementation In Moving Object Databases

Author

Listed:
  • ALİ R. KONAN

    (Computer Engineering Department, Boğaziçi University, 34342 Bebek, İstanbul, Turkey)

  • TAFLAN İ. GÜNDEM

    (Computer Engineering Department, Boğaziçi University, 34342 Bebek, İstanbul, Turkey)

  • MURAT E. KAYA

    (Computer Engineering Department, Boğaziçi University, 34342 Bebek, İstanbul, Turkey)

Abstract

Moving object databases (MOD) are being used in a wide range of location-based services that are of growing interest in many application areas. In the literature, several query types such as nearest neighbor, reverse nearest neighbor,k-nearest neighbor, and proximity queries have been considered in MOD. In this paper, we propose a novel operator called the assignment operator as a query type for MOD. The assignment operator is an operator used in a query to solve the assignment problem (also known as the weighted bipartite graph-matching problem). Assignment operator finds a perfect match between two sets of objects in a manner that minimizes a total cost. For instance, a set of moving objects such as taxi cabs are assigned to a set of customers in a manner that minimizes the total cost of traveling for the taxis. A possible implementation of the assignment operator in MOD and its performance evaluation are given.

Suggested Citation

  • Ali̇ R. Konan & Taflan İ. Gündem & Murat E. Kaya, 2010. "Assignment Query And Its Implementation In Moving Object Databases," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 9(03), pages 349-372.
    • Handle: RePEc:wsi:ijitdm:v:09:y:2010:i:03:n:s0219622010003853
    DOI: 10.1142/S0219622010003853
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219622010003853
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219622010003853?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijitdm:v:09:y:2010:i:03:n:s0219622010003853. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijitdm/ijitdm.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.