Multi-Way Distance Join Queries in Spatial Databases

  title={Multi-Way Distance Join Queries in Spatial Databases},
  author={Antonio Corral and Yannis Manolopoulos and Yannis Theodoridis and Michael Vassilakopoulos},
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistancevalue” of this n-tuple is the value of a linear function of distances of the n objects that make up this ntuple, according to the edges of the QG. This paper addresses the problem of finding the K n-tuples between n spatial datasets that have the smallest Ddistance-values, the so-called K-Multi-Way Distance Join Query (K-MWDJQ), where each set is indexed by an R-tree-based structure. This query can be… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 32 references

Arkoumanis: “Approximate Processing of Multiway Spatial Joins in Very Large Databases

  • D. D. Papadias
  • Proceedings of 8 EDBT Conference,
  • 2002

Lin: “An Index Structure for Improving Nearest Closest Pairs and Related Join Queries in Spatial Databases

  • K.I.C. Yang
  • Proceedings of International Database Engineering…
  • 2002

Object-Relational Database Development: a Plumber’s

  • P. Brown
  • 2001

Similar Papers

Loading similar papers…