TITLE

MK-tree: An Effective Access Method for Indexing High Dimensional Data

AUTHOR(S)
Guoren Wang; Xiangmin Zhou; Bin Wang; Baiyou Qiao; Donghong Han
PUB. DATE
December 2005
SOURCE
Journal of Digital Information Management;Dec2005, Vol. 3 Issue 4, p257
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper, we propose an efficient access method, named MK-tree, to dynamically index large data sets in high dimensional spaces. It is an extension of M-tree with key dimension to improve the efficiency of space partition and reduce the response time of similarity search for high dimensional data. The main idea behind the key dimension is to make the fanout of tree larger by partitioning a subspace further into two subspaces, called a twin-node, according to the key dimension. To get a high space utilization, we conduct data reallocation within a twin-node dynamically, therefore further improve the performance of MK-tree. Our experimental results show that a higher filtering efficiency can be obtained by using the concept of key dimension for both R-neighbor search and K-nearest neighbor search.
ACCESSION #
19696313

 

Related Articles

  • The Next-Generation Data Tier: A Repository for Integration Assets. Bacon, Stephanos // DM Review;Dec2004, Vol. 14 Issue 12, p14 

    This article focuses on the emergence of enterprise data tier and its integration into standard architectures and interfaces. The creation of enterprise data tier is becoming a practical reality with standard architectures and interfaces. Creating a unified layer where applications can interact...

  • Dispatch From The Front Lines: A Global 100 Application Snapshot. Marinos, George // DM Review;Dec2004, Vol. 14 Issue 12, p44 

    This article presents a case of SAP implementation in data management. The data management group had addressed some good basic control functions, the quality control center was providing relatively effective guidance and many group heads already saw themselves as data owners who recognized the...

  • CDI Milestones on the MDM Roadmap, Part 2. Zornes, Aaron // DM Review;Jun2007, Vol. 17 Issue 6, p48 

    The article discusses the factors to consider in customer data integration (CDI) and master data management (MDM). According to the author, CDI and MDM will continue to focus significant research and development as well as marketing resources on industry content of data models. On the other...

  • Piggyback Statistics Collection for Query Optimization: Towards a Self-Maintaining Database Management System. Qiang Zhu; Dunkel, Brian; Wing Lau; Suyun Chen; Schiefer, Berni // Computer Journal;2004, Vol. 47 Issue 2, p221 

    A database management system (DBMS) performs query optimization based on statistical information about data in the underlying database. Out-of-date statistics may lead to inefficient query processing in the system. The existing utility method, which collects statistics in batch mode, suffers...

  • Frequent Item Set Mining using Convertible Constraints in IMine. Prakash, T. Senthil; Thangaraj, P. // European Journal of Scientific Research;11/29/2011, Vol. 65 Issue 1, p93 

    Frequent itemset mining has turned out to be a familiar area of investigation in the data mining field. Its key objective is to determine the sets of items that come collectively more than a specified threshold value based on the need. The IMine index structure provides the more common and...

  • Compulink's LaserFiche System.  // Information Today;Jul/Aug1988, Vol. 5 Issue 7, p29 

    This article provides information on the LaserFiche System, an integrated document search, update, archival and retrieval system utilizing laser technologies, released by Compulink Management Center, Inc. in 1988. The LaserFiche system can replace paper copiers, filing systems, microfiche and...

  • The Seven Stages of Database Design. Griffith, Cary // Information Today;Jun1991, Vol. 8 Issue 6, p42 

    The article discusses the stages of database design. Several law offices use personal computers and database applications to create a variety of in-house databases. Legal-specific in-house databases include timekeeping/billing, case management tracking and conflict of interest. There are several...

  • Graph Databases- An Overview. Patil, Shefali; Vaswani, Gaurav; Bhatia, Anuradha // International Journal of Computer Science & Information Technolo;2014, Vol. 5 Issue 1, p657 

    For a long time, data has been typically stored in tabular form so as to increase the indexing and readability. Nowadays, the trends are changing as Graph databases are quickly gaining popularity. In fact, it would not be wrong to call them "the future of DBMS". The representation of data in the...

  • Performance Evaluation of Columnar Multi-Block Vector Structure. Deb, Rupam; Islam, Kazi Rafiqul; Kashem, Md. Abul; Hossain, Md. Jakir // International Journal of Electrical & Computer Sciences;Dec2009, Vol. 9 Issue 10, p28 

    Lower storage capacity and slower access time are the main problems of the Database Management System (DBMS). In this paper, we have been compared the storage and access time between the columnar multi-block vector structure (CMBVS) and Oracle 9i server. The experimental results shown that CMBVS...

  • Tips on Gathering Statistics for Better Database Performance. Kumar R., Arun // Database Trends & Applications;Jun2005, Vol. 19 Issue 6, p37 

    Discusses ways for gathering statistics for better database performance.

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics