NDLI: Join operations in temporal databases

Please wait, while we are loading the content...

Join operations in temporal databases

Content Provider	Springer Nature Link
Author	Gao, Dengfeng Jensen, Christian S. Sdgrass, Richard T. Soo, Michael D.
Copyright Year	2005
Abstract	Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the evaluation of joins with equality predicates rather than the inequality predicates prevalent in valid-time queries. Second, the presence of temporally varying data dramatically increases the size of a database. These factors indicate that specialized techniques are needed to efficiently evaluate temporal joins.We address this need for efficient join evaluation in temporal databases. Our purpose is twofold. We first survey all previously proposed temporal join operators. While many temporal join operators have been defined in previous work, this work has been done largely in isolation from competing proposals, with little, if any, comparison of the various operators. We then address evaluation algorithms, comparing the applicability of various algorithms to the temporal join operators and describing a performance study involving algorithms for one important operator, the temporal equijoin. Our focus, with respect to implementation, is on non-index-based join algorithms. Such algorithms do not rely on auxiliary access paths but may exploit sort orderings to achieve efficiency.
Starting Page	2
Ending Page	29
Page Count	28
File Format	PDF
ISSN	10668888
Journal	The VLDB Journal
Volume Number	14
Issue Number	1
e-ISSN	0949877X
Language	English
Publisher	Springer-Verlag
Publisher Date	2005-01-01
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Attribute skew Interval join Partition join Sort-merge join Temporal Cartesian product Temporal join Timestamp skew Database Management
Content Type	Text
Resource Type	Article
Subject	Information Systems Hardware and Architecture

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

Disjoint interval partitioning

A parallel sort merge join algorithm for managing data skew

SQL extension for spatio-temporal data

Which sort orders are interesting?

A highly optimized algorithm for continuous intersection join queries over moving objects

Sort-sharing-aware query processing

Super-EGO: fast multi-dimensional similarity join

Temporal XML: modeling, indexing, and query processing

BerlinMOD: a benchmark for moving object databases

Join operations in temporal databases

Similar Documents

Disjoint interval partitioning

A parallel sort merge join algorithm for managing data skew

SQL extension for spatio-temporal data

Which sort orders are interesting?

A highly optimized algorithm for continuous intersection join queries over moving objects

Sort-sharing-aware query processing

Super-EGO: fast multi-dimensional similarity join

Temporal XML: modeling, indexing, and query processing

BerlinMOD: a benchmark for moving object databases

Join operations in temporal databases