Skip to main content

Cover Ratio of Absolute Neighbor

(Towards an Index Structure for Efficient Retrieval)

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4921))

Included in the following conference series:

  • 368 Accesses

Abstract

Voronoi diagrams for a fix set of generators are considered with varying L p norm. For a generator q in the set, the absolute neighbor of q is defined to be the intersection of all Voronoi regions of q by L p norm(pā€‰=ā€‰1, 2, ...,ā€‰āˆž). Since the shape of Voronoi region is dependent on the norm used, the collection of absolute neighbors for the set does not always cover the whole space.

In this paper, we construct absolute neighbors and computed the ratio, called cover ratio, of the volume covered by all absolute neighbors to that of the whole space for some sets of generators by computational experiments. Computational experiments show that the cover ratio is higher when a configuration of grid points is used as a set of generators than when a set of random generators is used. Moreover, we theoretically show that the absolute neighbors for square configuration and for face-centered configuration cover the whole space. We also discuss an application of absolute neighbors to constructing an index structure of the whole space for efficient retrieval.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bƶhm, C., Berchtold, S., Keim, A.D.: Searching in High-Dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases. ACM Computing SurveysĀ 33(3), 322ā€“373 (2001)

    ArticleĀ  Google ScholarĀ 

  2. Brin, S.: Near Neighbor Search in Large Metric Spaces. In: Proc. of the 21st International Conference on VLDB, pp. 574ā€“584 (1995)

    Google ScholarĀ 

  3. ChĆ”vez, E., Navarro, G., Baeza-Yates, R., Marroquin, J.L.: Searching in Metric Spaces. ACM Computing SurveysĀ 33(3), 273ā€“321 (2001)

    ArticleĀ  Google ScholarĀ 

  4. Ciaccia, P., Patella, P.: Searching in Metric Spaces with User-Defined and Approximate Distances. ACM Transactions on Database SystemsĀ 27(4), 398ā€“437 (2002)

    ArticleĀ  Google ScholarĀ 

  5. Kimura, A., Onishi, K., Kobayakawa, M., Hoshi, M., Ohmori, T.: Distance Conversion Rule for Arbitrary L p distance. IPSJ Transactions on DatabasesĀ 46, 93ā€“105 (2005)

    Google ScholarĀ 

  6. Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd edn. John Wiley & Sons Ltd, Chichester (2000)

    MATHĀ  Google ScholarĀ 

  7. Onishi, K.: Intersection of Voronoi Regions by L p distance. In: Proc. of Japan Conference on Discrete and Computational Geometry 1999, pp. 26ā€“28 (1999)

    Google ScholarĀ 

  8. Onishi, K., Kobayakawa, M., Hoshi, M.: mm-GNAT: index structure for arbitrary L p norm. In: MDDM 2007. Proc. of The Second IEEE International Workshop on Multimedia Databases and Data Management, pp. 117ā€“126 (2007)

    Google ScholarĀ 

  9. Yi, B.-K., Faloutsos, C.: Fast Time Sequence Indexing for Arbitrary L p Norms. In: Proc. of the 26th International Conference on VLDB, pp. 385ā€“394 (2000)

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Shin-ichi Nakano Md. Saidur Rahman

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Onishi, K., Hoshi, M. (2008). Cover Ratio of Absolute Neighbor. In: Nakano, Si., Rahman, M.S. (eds) WALCOM: Algorithms and Computation. WALCOM 2008. Lecture Notes in Computer Science, vol 4921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77891-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77891-2_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77890-5

  • Online ISBN: 978-3-540-77891-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics