KSR-Quadtree: an Intelligent Knowledge Storage and Retrieval Using Quadtree Structure


(*) Corresponding author


Authors' affiliations


DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)

Abstract


The size of the data in modern applications grows at an increasing rate. The voluminous database stored in direct access storage device requires more number of disk accesses and the database requires rescanning due to frequent updates. This leads to increased retrieval time. Also, the information retrieved from repository of data cannot guide decision-makers or management to make correct decisions as humans. In this paper, we propose a Knowledge Based System which converts the existing database into Quad tree. Here, the quad trees are used in arriving at decisions on what kind of plants can be that grown in soil  based on the domain information (edaphology-soil characteristics) given by the user. The domain information that is stored as an application database is converted into a knowledge base using the dynamic quad-tree data structure. This system is designed with two phases namely, (1) Knowledge storage (as quad-tree) and (2) Effective knowledge retrieval. In the first phase, the records from the database are converted into 2Dpoints and store the point recursively in a two-dimensional space with four recursive quadrants. In the second phase, knowledge retrieval is done with the help of the constructed knowledge base (XML architecture). This system transforms the voluminous database storage into a file thereby reducing the number of disk access and retrieval time. The rescanning of Database is also avoided and supports the edaphologists in making right decisions.
Copyright © 2013 Praise Worthy Prize - All rights reserved.

Keywords


Quad-Tree; Knowledge Retrieval; XML Database; Knowledge Base

Full Text:

PDF


References


Shyh-Kwei Chen, “An Exact Closed-Form Formula For D-Dimensional Quadtree Decomposition Of Arbitrary Hyperrectangles”, IEEE Transactions On Knowledge And Data Engineering, Vol 18, No. 6, June 2006.

Omer Egecioglu, Hakan Ferhatosmanoglu, And Umit Ogras, ”Dimensionality reduction and similarity Computation by inner-product approximations”,IEEE Transactions On Knowledge And Data Engineering, Vol. 16, No. 6, June 2004.

Brian Kulis, MemberPrateek Jain and Kristen Grauman, “Fast Similarity Search For Learned Metrics”, IEEE Transactions On Pattern Analysis And Machine Intelligence, Vol. 31, No. 12, December 2009.

Kyuseok Shim, Ramakrishnan Srikant, And Rakesh Agarwal, “High-Dimensional Similarity Joins”, IEEE Transactions On Knowledge And Data Engineering, Vol 14, No 1, January/February 2002.

D. S.Yeung, And X.Z. Wang, “Improving Performance Of Similarity-Based Clustering By Feature Weight Learning”, IEEE Transactions On Pattern Analysis And Machine Intelligence,Vol 24, No 4, April 2002.

You Jung Kim And Jignesh M.Patel, Performance Comparison Of The R*-Tree And The Quadtree For Knn And Distance Join Queries, IEEE Transactions On Knowledge And Data Engineering, Vol 22, No 7, July 2010.

Xiaofeng Zhu,Shichao Zhang, Zhi Jin, Zili Zhang And Zhuoming Xu,”Missing Value Estimation For Mixed-Attribute Data Sets”,IEEE Transactions On Knowledge And Data Engineering, Vol 23, No 1, January 2011.

Zhiwei Linhui Wangand Sally Mcclean,”A Multi-Dimensional Sequence Approach To Measuring Tree Similarity”,IEEE Transactions On Knowledge And Data Engineering.

B.B.Chaudhuri,”Application Of Quadtree,Octree, And Binary Tree Decomposition Techniques To Shape Analysis And Pattern Recognition”, IEEE Transactions On Pattern Analysis And Machine Intelligence,Vol,Pami-7, No.6, November 1985.

Christos Faloutsos,H.V.Jagadish And Yannis Manolopoulos, “Analysis Of The N-Dimensional Quadtree Decomposition For Arbitrary Hyperrectangles”, IEEE Transactions On Knowledge And Data Engineering , Vol.9, No.3, May/June 1997.

Chengjun Liu, ”The Bayes Decision Rule Induced Similarity Measures”, IEEE Transactions On Pattern Analysis And Machine Intelligence, Vol.29, No.6, June 2007.

Hanan Samet,” A Top-Down Quadtree Traversal Algorithm”, IEEE Transactions On Pattern Analysis And Machine Intelligence, Vol, Pami-7, No.1, January 1985.

Sameer A. Nene and Shree K. Nayar, ”A Simple Algorithm for Nearest Neighbor Search in High Dimensions”, IEEE Transactions On Pattern Analysis And Machine Intelligence, Vol. 19, no. 9, September 1997.

Jo-Mei Chang And King-Sun Fu,”Extended K-d Tree Database Organization: A Dynamic Multiattribute Clustering Method”, IEEE Transactions On Software Engineering, Vol. Se-7, no. 3, May 1981.

David Eppstein,Michael T.Goodrich and Jonathan Z. Sun,”The Skip Quad-tree: A simple Dynamic Data Structure for Multidimensional Data”.

Jon Louis Bentley, ”Multidimensional Binary Search Trees used for Associative Searching”, Communications of ACM ,Vol 18, No. 9, September 1975.

A.Meenakshi and V. Mohan, “An Efficient Tree-Based System for Knowledge Management in Edaphology”, European Journal of Scientific Research, Vol.42, No.2, pp.253-267, 2010.

Rizwana Irfan and Maqbool-uddin-Shaikh , “Enhance Knowledge Management Process for Group Decision Making”, In Proceedings of World Academy of Science, Engineering and Technology, 2009.

Lin Cui, Caiyin Wang, A Resource Retrieval Scheme based on Ontology Reasoning under Semantic P2P System, (2012) International Review on Computers and Software (IRECOS), 7 (4) pp. 1850-1854.

Feifei Tao, Huimin Wang, Jinle Kang, Lei Qiu, Study on Knowledge Base System of Extreme Flood Magnitude Based on Data Driven Reasoning, (2012) International Review on Computers and Software (IRECOS), 7 (5) pp. 2226-2230.


Refbacks

  • There are currently no refbacks.


Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize