Scribd Logo
Upload

Welcome to Scribd!

  • 40 views

    Indexing For Multidimensional Data: An Introduction

    Uploaded by

    Sairam Vema
    The document discusses indexing for multidimensional data. It describes applications that involve multidimensional data like spatial databases and GIS. Good index structures should support dynamic insertion/deletion, different types of queries, and have good performance and storage utilization. Hierarchical structures allow focusing search on interesting subsets of data. Common structures discussed include B-trees, B+-trees, quad-trees, k-d trees, grid files, and R-trees for spatial indexing. The challenges of indexing multiple attributes are also addressed.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd

    Indexing For Multidimensional Data: An Introduction

    Uploaded by

    Sairam Vema
    40 views13 pages
    The document discusses indexing for multidimensional data. It describes applications that involve multidimensional data like spatial databases and GIS. Good index structures should support dynamic insertion/deletion, different types of queries, and have good performance and storage utilization. Hierarchical structures allow focusing search on interesting subsets of data. Common structures discussed include B-trees, B+-trees, quad-trees, k-d trees, grid files, and R-trees for spatial indexing. The challenges of indexing multiple attributes are also addressed.

    Original Title

    1 Introduction

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses indexing for multidimensional data. It describes applications that involve multidimensional data like spatial databases and GIS. Good index structures should support dynamic insertion/deletion, different types of queries, and have good performance and storage utilization. Hierarchical structures allow focusing search on interesting subsets of data. Common structures discussed include B-trees, B+-trees, quad-trees, k-d trees, grid files, and R-trees for spatial indexing. The challenges of indexing multiple attributes are also addressed.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    40 views13 pages

    Indexing For Multidimensional Data: An Introduction

    Uploaded by

    Sairam Vema
    The document discusses indexing for multidimensional data. It describes applications that involve multidimensional data like spatial databases and GIS. Good index structures should support dynamic insertion/deletion, different types of queries, and have good performance and storage utilization. Hierarchical structures allow focusing search on interesting subsets of data. Common structures discussed include B-trees, B+-trees, quad-trees, k-d trees, grid files, and R-trees for spatial indexing. The challenges of indexing multiple attributes are also addressed.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 13

    Indexing for Multidimensional

    Data

    An Introduction
    Applications of
    Multidimensional Databases
     Normal databases with multiple key
     Spatial databases
     Geographic information system (GIS)
     Computer-aided design (CAD)
     Multimedia databases
     Medical applications

    Jaruloj Chongstitvatan Advanced Data Structures 2


    a
    Characteristics of
    Good Index Structures (1)
     Dynamic
    • Insert, delete, and update data in any order
     Handle necessary queries
    • Point or exact queries
    • Range quesries
    • Spatial queries
    • Boolean queries

    Jaruloj Chongstitvatan Advanced Data Structures 3


    a
    Characteristics of
    Good Index Structures (2)
     Good performance (disk accesses,
    running time, etc.) for
    • Query, insert, delete
     Good storage (memory or disk)
    utilization
    • Low percentage of waste space
     Scalability
     Simple

    Jaruloj Chongstitvatan Advanced Data Structures 4


    a
    Why hierarchical structures
     Allow the search to be focused on
    interesting subset of data
     Eliminate useless search
     Clean and simple implementation

    Jaruloj Chongstitvatan Advanced Data Structures 5


    a
    Hierarchical index structures for
    single attribute

    B tree B+ tree
     Binary tree  N-ary tree
     Unbalanced  Height-balanced
     Organize data  Organize data space
     Memory-based index  Disk-based index
    • Measuring the running • Measuring the number
    time of disk accesses
     Practical mem. size  Disk page size

    Jaruloj Chongstitvatan Advanced Data Structures 6


    a
    B tree
    10

    4 20

    6 9

    Jaruloj Chongstitvatan Advanced Data Structures 7


    a
    B+ tree

    16 31

    6 11 14 19 22 48

    Jaruloj Chongstitvatan Advanced Data Structures 8


    a
    Handling multiple attributes (1)
     Separate index structure for each attributes
    • Update all index structures for each record
    update.
    • Data are scattered in many disk pages.

    a1 a2 a3 a4

    disk

    Jaruloj Chongstitvatan Advanced Data Structures 9


    a
    Handling multiple attributes (2)
     Bit interleaving

     Attribute interleaving

    Jaruloj Chongstitvatan Advanced Data Structures 10


    a
    Multiple-attribute indexing
     Quad-tree
     k-d tree
     k-d-B tree
     Grid file
     hB-tree

    Jaruloj Chongstitvatan Advanced Data Structures 11


    a
    Spatial Indexing
     R-tree
     R*-tree
     SKD-tree

    Jaruloj Chongstitvatan Advanced Data Structures 12


    a
    High-dimensional indexing
     SS-tree
     TV-tree

    Jaruloj Chongstitvatan Advanced Data Structures 13


    a

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy