Performance Evaluation of G-tree and Its Application in Fuzzy Databases.

Chengwen Liu, Aris M. Ouksel, A. Prasad Sistla, Jing Wu, Clement T. Yu, Naphtali Rishe: Performance Evaluation of G-tree and Its Application in Fuzzy Databases. CIKM 1996: 235-242

@inproceedings{DBLP:conf/cikm/LiuOSWYR96,
  author    = {Chengwen Liu and
               Aris M. Ouksel and
               A. Prasad Sistla and
               Jing Wu and
               Clement T. Yu and
               Naphtali Rishe},
  title     = {Performance Evaluation of G-tree and Its Application in Fuzzy
               Databases},
  booktitle = {CIKM '96, Proceedings of the Fifth International Conference on
               Information and Knowledge Management, November 12 - 16, 1996,
               Rockville, Maryland, USA},
  publisher = {ACM},
  year      = {1996},
  pages     = {235-242},
  ee        = {db/conf/cikm/LiuOSWYR96.html, http://doi.acm.org/10.1145/238355.238503},
  crossref  = {DBLP:conf/cikm/96},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Abstract

G-tree is a data structure designed to provide multi-dimensional access in databases. It has the self-balancing property of B⁺-trees. In this paper, performance evaluation of G-tree is provided for various data distributions. For point queries, the experiments show that its retrieval and update performance is similar to that of B⁺-trees independently of the data distribution. For range queries, the performance varies significantly with the data distributions. While the performance is good for the 2-dimensional case, it deteriorates as the number of dimensions increases. This empirical evidence is confirmed by an analytical proof, which also yields a simple way of computing the expected number of data pages accessed. This analytical result which shows that the number of data pages accessed by a range query increases exponentially with the number of dimensions applies to many multi-dimensional schemes. We also apply the G-tree to fuzzy databases and show empirically that it is inefficient for precise queries on relatively precise data. Its performance is acceptable for imprecise queries on relatively imprecise data.

Copyright © 1996 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 2 Issue 4, CIKM, DOLAP, GIS, SIGFIDET, ..." and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/An2-4 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

BibTeX

Printed Edition

CIKM '96, Proceedings of the Fifth International Conference on Information and Knowledge Management, November 12 - 16, 1996, Rockville, Maryland, USA. ACM 1996
Contents BibTeX

Online Edition

Citation Page BibTeX

BibTeX

ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]

CIKM 1996 Proceedings, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:01:53 2009