Scribd Logo
Upload

Welcome to Scribd!

  • 57 views

    Issues in Indexing

    Uploaded by

    National Services Academy
    The document discusses several issues related to indexing, including: 1) Multi-dimensional indexing and how to index regions in space, document collections, and multi-dimensional sales data as well as support nearest neighbor queries. 2) Three indexing exercises involving a purchase table, airline reservation table, and web log data to be loaded into a database. 3) Components of a query execution plan including the logical tree, implementation choices, and scheduling of operations.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Issues in Indexing

    Uploaded by

    National Services Academy
    57 views8 pages
    The document discusses several issues related to indexing, including: 1) Multi-dimensional indexing and how to index regions in space, document collections, and multi-dimensional sales data as well as support nearest neighbor queries. 2) Three indexing exercises involving a purchase table, airline reservation table, and web log data to be loaded into a database. 3) Components of a query execution plan including the logical tree, implementation choices, and scheduling of operations.

    Original Title

    15943293 (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses several issues related to indexing, including: 1) Multi-dimensional indexing and how to index regions in space, document collections, and multi-dimensional sales data as well as support nearest neighbor queries. 2) Three indexing exercises involving a purchase table, airline reservation table, and web log data to be loaded into a database. 3) Components of a query execution plan including the logical tree, implementation choices, and scheduling of operations.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    57 views8 pages

    Issues in Indexing

    Uploaded by

    National Services Academy
    The document discusses several issues related to indexing, including: 1) Multi-dimensional indexing and how to index regions in space, document collections, and multi-dimensional sales data as well as support nearest neighbor queries. 2) Three indexing exercises involving a purchase table, airline reservation table, and web log data to be loaded into a database. 3) Components of a query execution plan including the logical tree, implementation choices, and scheduling of operations.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 8

    Issues in Indexing

    • Multi-dimensional indexing:
    – how do we index regions in space?
    – Document collections?
    – Multi-dimensional sales data
    – How do we support nearest neighbor queries?

    • Indexing is still a hot and unsolved problem!


    Indexing Exercise #1
    • The Purchase table:
    – date, buyer, seller, store, product

    • Reports are generated once a day.

    • What’s the best file-organization/indexing


    strategy?
    Indexing Exercise #2
    • Airline database: Reservations table --
    – flight#, seat#, date#, occupied, customer-id
    Indexing Exercise #3
    • Web log application: load all the logs every
    night into a database.
    • Generate reports every day (for curious
    professors).
    User/ Query
    Query Execution
    Application update
    Query compiler
    Query execution
    plan
    Execution engine
    Record, index
    requests
    Index/record mgr.
    Page
    commands
    Buffer manager
    Read/write
    pages
    Storage manager

    storage
    Query Execution Plans
    SELECT S.sname buyer
    FROM Purchase P, Person Q
    WHERE P.buyer=Q.name AND

    Q.city=‘seattle’ AND City=‘seattle’ phone>’5430000’

    Q.phone > ‘5430000’

    Query Plan: Buyer=name (Simple Nested Loops)


    • logical tree
    • implementation Purchase Person
    (Table scan) (Index scan)
    choice at every
    node Some operators are from relational
    • scheduling of algebra, and others (e.g., scan, group)
    operations. are not.
    Scans
    • Table scan: iterate through the records of
    the relation.
    • Index scan: go to the index, from there get
    the records in the file (when would this be
    better?)
    • Sorted scan: produce the relation in order.
    Implementation depends on relation size.
    Putting them all together
    • The iterator model. Each operation is implemented
    by 3 functions:
    – Open: sets up the data structures and performs
    initializations
    – GetNext: returns the the next tuple of the result.
    – Close: ends the operations. Cleans up the data structures.
    • Enables pipelining!
    • Contrast with data-driven materialize model.
    • Sometimes it’s the same (e.g., sorted scan).

    You might also like