Call for Paper - March 2023 Edition
IJCA solicits original research papers for the March 2023 Edition. Last date of manuscript submission is February 20, 2023. Read More

Effectively and Efficiency Consideration for Spatial Database

Print
PDF
International Journal of Computer Applications
© 2013 by IJCA Journal
Volume 74 - Number 18
Year of Publication: 2013
Authors:
Mohammed Otair
10.5120/12987-0232

Mohammed Otair. Article: Effectively and Efficiency Consideration for Spatial Database. International Journal of Computer Applications 74(18):32-37, July 2013. Full text available. BibTeX

@article{key:article,
	author = {Mohammed Otair},
	title = {Article: Effectively and Efficiency Consideration for Spatial Database},
	journal = {International Journal of Computer Applications},
	year = {2013},
	volume = {74},
	number = {18},
	pages = {32-37},
	month = {July},
	note = {Full text available}
}

Abstract

Metric spaces are very useful in spatial database, and other applications that deal with it. Especially when want to found object that are similar to other object. This condition does not handle the relative position that found in some tree, such that, R-Tree, R+-Tree, and R*-Tree. Instead of handling distances between objects, using Euclidean Distance to compute the similarity between them, and retrieve the sets of object from database based on Euclidean distance that make this situation is happen and occurs. This paper proposed methods for similarity search that make the general assumption in the similarity can be done, by focusing on the effectively and efficiency in metric space for spatial database. This paper introduces how to improve the effectively and efficiency of the spatial database. It provided to extract some knowledge from spatial database has been presented. The main goal is to know how the search occurs, by using some assumption and ensures that there is similarity between a given queries Q and a set of object that found in the database.

References

  • Eamonn Keogh, Selina Chu, and Michael Pazzani (2001): A New Approach to Indexing Large Databases
  • Slobodan Rasetic, Jörg Sander, James Elding Mario A. Nascimento (2005), A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing
  • Ralf Hartmut GQting (2004),An Introduction to Spatial Database Systems. Received July 25, 1994; accepted August 18, 1994.
  • TOLGA BOZKAYA, and MERAL OZSOYOGLU (2000). Indexing Large Metric Spaces for Similarity Search Queries
  • ESSAM A. EL-KWAE , and MANSUR R. KABUKA (2000). Efficient Content-Based Indexing of Large Image Databases.
  • GISLI R. HJALTASON and HANAN SAMET (2003). Index-Driven Similarity Search in Metric Spaces . ACM Transactions on Database Systems, Vol. 28, No. 4, December 2003, Pages 517–580.
  • Alock Aggarwal and Jeffery scott Vitter. The input/output complexity of sorting and related problem. Communication of ACM,1988.
  • Ravidra K. Ahuja, Thomas L. Ma and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
  • http://en. wikipedia. org/wiki/Euclidean_distance,Elena Deza & Michel Marie Deza (2009) Encyclopedia of Distances, page 94, Springer