V Implementation Techniques 34 Efficient Evaluation of the Valid-Time Natural Join 35 Efficient Differential Timeslice Computation 36 R-Tree Based Indexing of Now-Relative Bitemporal Data - Valid time - Document - PDFSEARCH.IO

First Page	Meta Content
	V Implementation Techniques 34 Efficient Evaluation of the Valid-Time Natural Join 35 Efficient Differential Timeslice Computation 36 R-Tree Based Indexing of Now-Relative Bitemporal Data Add to Reading List Document Date: 2000-04-03 08:02:00 Open Document File Size: 22,77 KB Share Result on Facebook IndustryTerm transaction processing / query processing architectures / temporal-join algorithm / / Organization IMPLEMENTATION TECHNIQUES Chapter / / Position General / data manager / manager component / / Technology DBMS / partition-based algorithm / temporal-join algorithm / / SocialTag Information Database Temporal database Bitemporal data SQL Concurrency control Book:Databases Database management systems Data management Data

V Implementation Techniques 34 Efficient Evaluation of the Valid-Time Natural Join 35 Efficient Differential Timeslice Computation 36 R-Tree Based Indexing of Now-Relative Bitemporal DataAdd to Reading List