NDLI: Multi-table joins through bitmapped join indices

Content Provider	ACM Digital Library
Author	O'Neil, Patrick Graefe, Goetz
Abstract	This technical note shows how to combine some well-known techniques to create a method that will efficiently execute common multi-table joins. We concentrate on a commonly occurring type of join known as a star-join, although the method presented will generalize to any type of multi-table join. A star-join consists of a central detail table with large cardinality, such as an orders table (where an order row contains a single purchase) with foreign keys that join to descriptive tables, such as customers, products, and (sales) agents. The method presented in this note uses join indices with compressed bitmap representations, which allow predicates restricting columns of descriptive tables to determine an answer set (or foundset) in the central detail table; the method uses different predicates on different descriptive tables in combination to restrict the detail table through compressed bitmap representations of join indices, and easily completes the join of the fully restricted detail table rows back to the descriptive tables. We outline realistic examples where the combination of these techniques yields substantial performance improvements over alternative, more traditional query evaluation plans.
Starting Page	8
Ending Page	11
Page Count	4
File Format	PDF
ISSN	01635808
DOI	10.1145/211990.212001
Journal	ACM SIGMOD Record (SGMD)
Volume Number	24
Issue Number	3
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1999-06-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Multi-table joins through bitmapped join indices (1995)

Abstract Multi-Table Joins Through Bitmapped Join Indices

Fast joins using join indices

Joins via Geometric Resolutions: Worst Case and Beyond

Multi-step processing of spatial joins

Faster Joins � Self Joins and Multi Way Joins Using Join Indices

Parallel evaluation of multi-join queries

Adaptive multi-stage distance join processing

Efficient top-k similarity join processing over multi-valued objects

Multi-table joins through bitmapped join indices

Similar Documents

Multi-table joins through bitmapped join indices (1995)

Abstract Multi-Table Joins Through Bitmapped Join Indices

Fast joins using join indices

Joins via Geometric Resolutions: Worst Case and Beyond

Multi-step processing of spatial joins

Faster Joins � Self Joins and Multi Way Joins Using Join Indices

Parallel evaluation of multi-join queries

Adaptive multi-stage distance join processing

Efficient top-k similarity join processing over multi-valued objects

Multi-table joins through bitmapped join indices