Advertisement

Optimization of Spatial Joins on Mobile Devices

  • Nikos Mamoulis
  • Panos Kalnis
  • Spiridon Bakiras
  • Xiaochen Li
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2750)

Abstract

Mobile devices like PDAs are capable of retrieving information from various types of services. In many cases, the user requests cannot directly be processed by the service providers, if their hosts have limited query capabilities or the query combines data from various sources, which do not collaborate with each other. In this paper, we present a framework for optimizing spatial join queries that belong to this class. We presume that the connection and queries are ad-hoc, there is no mediator available and the services are non-collaborative. We also assume that the services are not willing to share their statistics or indexes with the client. We retrieve statistics dynamically in order to generate a low-cost execution plan, while considering the storage and computational power limitations of the PDA. Since acquiring the statistics causes overhead, we describe an adaptive algorithm that optimizes the overall process of statistics retrieval and query execution. We demonstrate the applicability of our methods with a prototype implementation on a PDA with wireless network access.

Keywords

Mobile Device Nest Loop Mobile Client Execution Plan Query Execution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adali, S., Selçuk Candan, K., Papakonstantinou, Y., Subrahmanian, V.S.: Query caching and optimization in distributed mediator systems. In: Proc. of ACM SIGMOD Int’l Conference (1996)Google Scholar
  2. 2.
    Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S.: Scalable sweeping-based spatial join. In: Proc. of VLDB Conference (1998)Google Scholar
  3. 3.
    Brinkhoff, T., Kriegel, H.-P., Seeger, B.: Efficient processing of spatial joins using r-trees. In: Proc. of ACM SIGMOD Int’l Conference (1993)Google Scholar
  4. 4.
    Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest pair queries in spatial databases. In: Proc. of ACM SIGMOD Int’l Conference (2000)Google Scholar
  5. 5.
    Dittrich, J.-P., Seeger, B.: Data redundancy and duplicate detection in spatial join processing. In: Proc. of Int’l Conf. on Data Engineering, ICDE (2000)Google Scholar
  6. 6.
    Guttman, A.: R-trees: a dynamical index structure for spatial searching. In: Proc. of ACM SIGMOD Int’l Conference (1984)Google Scholar
  7. 7.
    Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: Proc. of ACM SIGMOD Int’l Conference (1998)Google Scholar
  8. 8.
    Ives, Z.G., Florescu, D., Friedman, M., Levy, A.Y., Weld, D.S.: An adaptive query execution system for data integration. In: Proc. of ACM SIGMOD Int’l Conference (1999)Google Scholar
  9. 9.
    Koudas, N., Sevcik, K.C.: High dimensional similarity joins: Algorithms and performance evaluation. In: Proc. of Int’l Conf. on Data Engineering, ICDE (1998)Google Scholar
  10. 10.
    Liu, D., Lim, E.-P., Ng, W.K.: Efficient k nearest neighbor queries on remote spatial databases using range estimation. In: Proc of Int’l Conference on Scientific and Statistical Database Management, SSDBM (2002)Google Scholar
  11. 11.
    Lo, M.-L., Ravishankar, C.V.: Spatial hash-joins. In: Proc. of ACM SIGMOD Int’l Conference (1996)Google Scholar
  12. 12.
    Luo, G., Naughton, J.F., Ellmann, C.: A non-blocking parallel spatial join algorithm. In: Proc. of Int’l Conf. on Data Engineering, ICDE (2002)Google Scholar
  13. 13.
    Mamoulis, N., Papadias, D.: Integration of spatial join algorithms for processing multiple inputs. In: Proc. of ACM SIGMOD Int’l Conference (1999)Google Scholar
  14. 14.
    Patel, J.M., DeWitt, D.J.: Partition based spatial-merge join. In: Proc. of ACM SIGMOD Int’l Conference (1996)Google Scholar
  15. 15.
    Roth, M.T., Ozcan, F., Haas, L.M.: Cost models do matter: Providing cost information for diverse data sources in a federated system. In: Proc. of VLDB Conference (1999)Google Scholar
  16. 16.
    Shin, H., Moon, B., Lee, S.: Adaptive multi-stage distance join processing. In: Proc. of ACM SIGMOD Int’l Conference (2000)Google Scholar
  17. 17.
    Tan, K.-L., Ooi, B.-C., Abel, D.J.: Exploiting spatial indexes for semijoin-based join processing in distributed spatial databases. IEEE Trans. on Data and Knowledge Engineering 12(2), 920–937 (2000)Google Scholar
  18. 18.
    Tomasic, A., Raschid, L., Valduriez, P.: Scaling access to heterogeneous data sources with disco. IEEE Trans. on Data and Knowledge Engineering 10(5), 808–823 (1998)CrossRefGoogle Scholar
  19. 19.
    Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-nearestneighbors queries in spatial databases. Technical Report CS07-02, HKUST, Hong Kong (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nikos Mamoulis
    • 1
  • Panos Kalnis
    • 2
  • Spiridon Bakiras
    • 3
  • Xiaochen Li
    • 2
  1. 1.Department of Computer Science and Information SystemsUniversity of Hong KongHong Kong
  2. 2.Department of Computer ScienceNational University of Singapore 
  3. 3.Department of Electrical and Electronic EngineeringUniversity of Hong KongHong Kong

Personalised recommendations