A B+-tree based indexing technique for fuzzy numerical data

被引:18
|
作者
Barranco, C. D. [1 ]
Campana, J. R. [2 ]
Medina, J. M. [2 ]
机构
[1] Pablo Olavide Univ, Sch Engn, Div Comp Sci, Seville 41013, Spain
[2] Univ Granada, Dept Comp Sci & Artificial Intelligence, E-18071 Granada, Spain
关键词
fuzzy numerical data indexing; fuzzy databases; large-scale systems;
D O I
10.1016/j.fss.2008.01.006
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper proposes an indexing technique for fuzzy numerical data which increases the performance of query processing when the query involves an atomic possibility measured flexible condition. The proposal is based on a classical indexing mechanism for numerical crisp data, B+-tree, which is implemented in most commercial database management systems (DBMS). This makes the proposed technique a good candidate for integration in a fuzzy DBMS when it is developed as an extension of a crisp DBMS. The efficiency of the proposal is contrasted with another indexing method for similar data and queries, G-tree, which is specifically designed to index multidimensional data. Results show that the proposal performance is similar to and more stable than the measured for G-tree when used for indexing fuzzy numbers. (C) 2008 Elsevier B.V. All rights reserved.
引用
下载
收藏
页码:1431 / 1449
页数:19
相关论文
共 50 条
  • [1] Indexing Possibilistic Numerical Data: The Interval B+-tree Approach
    De Tre, Guy
    De Mol, Robin
    Bronselaer, Antoon
    INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS, IPMU 2016, PT II, 2016, 611 : 305 - 316
  • [2] An indexing technique for fuzzy numerical data
    Barranco, Carlos D.
    Campana, Jesus R.
    Medina, Juan M.
    SCALABLE UNCERTAINTY MANAGEMENT, PROCEEDINGS, 2007, 4772 : 187 - +
  • [3] iDistance:: An adaptive B+-tree based indexing method for nearest neighbor search
    Jagadish, HV
    Ooi, BC
    Tan, KL
    Yu, C
    Zhang, R
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2005, 30 (02): : 364 - 397
  • [4] Full-text and structural XML indexing on B+-tree
    Shimizu, T
    Yoshikawa, M
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2005, 3588 : 451 - 460
  • [5] BdH-Tree: A B+-Tree based Indexing Method for Very Frequent Updates of Moving Objects
    Seo, Dong-Min
    Song, Seok-Il
    Park, Yong-Hun
    Yoo, Jae-Soo
    Kim, Myoung-Ho
    CSA 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND ITS APPLICATIONS, PROCEEDINGS, 2008, : 314 - +
  • [6] Full-text and structural indexing of XML documents on B+-tree
    Shimizu, T
    Yoshikawa, M
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2006, E89D (01): : 237 - 247
  • [7] B+-tree construction on massive data with Hadoop
    Huynh Cong Viet Ngu
    Jun-Ho Huh
    Cluster Computing, 2019, 22 : 1011 - 1021
  • [8] ALTERNATIVES TO THE B+-TREE
    BOSWELL, W
    THARP, AL
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 468 : 266 - 274
  • [9] Lazy-split B+-tree: a novel B+-tree index scheme for flash-based database systems
    Jin, Rize
    Cho, Hyung-Ju
    Lee, Sang-Won
    Chung, Tae-Sun
    DESIGN AUTOMATION FOR EMBEDDED SYSTEMS, 2013, 17 (01) : 167 - 191
  • [10] Lazy-split B+-tree: a novel B+-tree index scheme for flash-based database systems
    Rize Jin
    Hyung-Ju Cho
    Sang-Won Lee
    Tae-Sun Chung
    Design Automation for Embedded Systems, 2013, 17 : 167 - 191