next up previous contents
Up: T. Zurek: Optimisation of Previous: References


Index

1NF
Basic Concepts and Notations
js
Maintaining Complete IP-Tables
je
Maintaining Complete IP-Tables
$\hat{t}$
Basic Concepts and Notations
Merging Complete IP-Tables
r
Basic Concepts and Notations
R
Basic Concepts and Notations
r.ts
Basic Concepts and Notations
r.te
Basic Concepts and Notations
now
Temporal and Conventional Databases
A Hybrid Architecture
A Hybrid Architecture
IP-opt
Stage 2: Joining
Preliminaries
Preliminaries
RQk
Preliminaries
Preliminaries
A
Preliminaries
B
Preliminaries
Preliminaries
Preliminaries
pk
Preliminaries
p0
Preliminaries
pm
Preliminaries
Preliminaries
$\Join$
Definition of the Join
Preliminaries
Preliminaries
Preliminaries
R
Definition of the Join
Q
Definition of the Join
S
Definition of the Join
Stage 1: Repartitioning
Stage 1: Repartitioning
Stage 1: Repartitioning
Stage 1: Repartitioning
$A_1, A_2, \dots, A_m$
Definition of the Join
$B_1, B_2, \dots, B_n$
Definition of the Join
R'k
Stage 2: Joining
C
Stage 2: Joining
r
Definition of the Join
Stage 2: Joining
Stage 2: Joining
$r \circ q$
Definition of the Join
C
Definition of the Join
$R \Join_{\scriptscriptstyle C}Q$
Definition of the Join
R.Ai
Definition of the Join
Q.Bj
Definition of the Join
R
The Basic Issues
The Basic Issues
The Basic Issues
i
The Basic Issues
j
The Basic Issues
k
The Basic Issues
Stage 1: Repartitioning
r
Stage 1: Repartitioning
Stage 1: Repartitioning
Stage 1: Repartitioning
Stage 1: Repartitioning
Stage 1: Repartitioning
Stage 1: Repartitioning
Stage 1: Repartitioning
Stage 1: Repartitioning
C1(a)(R)
Stage 1: Repartitioning
Stage 2: Joining
Stage 2: Joining
Stage 2: Joining
C2(b)
Stage 2: Joining
C2(c)
Stage 2: Joining
Uniform Workloads
Uniform Workloads
Uniform Workloads
Uniform Strategies
Uniform Lifespan Partitioning
Rk
Basic Strategy
Qk
Basic Strategy
X
Basic Strategy
m
Basic Strategy
R'k
Variations
Q'k
Variations
XR
Variations
XQ
Variations
Variations
IP-opt
Basic Strategy
$R.A \;\theta\; Q.B$
Types of Joins
$\theta$
Types of Joins
Rk
Basic Strategy
Qk
Basic Strategy
X
Basic Strategy
Basic Strategy
Basic Strategy
Basic Strategy
R'k
Variations
XR
Variations
Q'k
Variations
XQ
Variations
Y
Black-Out Preprocessing Strategy
Black-Out Preprocessing Strategy
Y'
Black-Out Preprocessing Strategy
m
Experimental Evaluation
X
Experimental Evaluation
XR
Experimental Evaluation
XQ
Experimental Evaluation
Experimental Evaluation
Experimental Evaluation
Experimental Evaluation
R
The Basic Data Set
$i_{\scriptscriptstyle R}$
The Basic Data Set
Q
The Basic Data Set
The Basic Data Set
The Basic Data Set
The Basic Data Set
$i_{\scriptscriptstyle R}$
The Basic Data Set
The Basic Data Set
join 1
A General Comparison between
join 2
A General Comparison between
join 3
A General Comparison between
C
A General Comparison between
A General Comparison between
Y
A General Comparison between
m
Dependency on m
XR
Dependency on XR and XQ
XQ
Dependency on XR and XQ
X
Dependency on XR and XQ
Z
Dependency on XR and XQ
Dependency on
Dependency on
Dependency on
Dependency on
Dependency on
Dependency on
Dependency on
R
Q
a
Influence of the Condensation a
Y
Impact of Black-Out Preprocessing
Impact of Black-Out Preprocessing
Y'
Impact of Black-Out Preprocessing
Elementary Conditions
Elementary Conditions
Elementary Conditions
Elementary Conditions
Elementary Conditions
Elementary Conditions
Elementary Conditions
Composite Conditions
Composite Conditions
Composite Conditions
Composite Conditions
Composite Conditions
pR
Brute Force Nested-Loops Joins
pQ
Brute Force Nested-Loops Joins
R
Test Data Creation
Q
Test Data Creation
Manipulation of Interval Lengths
Manipulation of Interval Lengths
Profiles of the
Profiles of the
Profiles of the
Profiles of the
$\dot{R}_k$
Classification of Join Algorithms
$ \overset <3075\gt\gt\mbox{\scriptsize sta}{{\Join}$
Definition and Types of
$ \overset <3078\gt\gt\mbox{\scriptsize fin}{{\Join}$
Definition and Types of
$ \overset <3081\gt\gt\mbox{\scriptsize mt}{{\Join}$
Definition and Types of
$ \overset <3084\gt\gt\mbox{\scriptsize bef}{{\Join}$
Definition and Types of
$ \overset <3087\gt\gt\mbox{\scriptsize lo}{{\Join}$
Definition and Types of
$ \overset <3090\gt\gt\mbox{\scriptsize ro}{{\Join}$
Definition and Types of
$ \overset <3165\gt\gt\mbox{\scriptsize =}{{\Join}$
Definition and Types of
$ \overset <3168\gt\gt\mbox{\scriptsize aft}{{\Join}$
Definition and Types of
$ \overset <3171\gt\gt\mbox{\scriptsize olp}{{\Join}$
Definition and Types of
$ \overset <3174\gt\gt\mbox{\scriptsize con}{{\Join}$
Definition and Types of
$ \overset <3177\gt\gt\mbox{\scriptsize dur}{{\Join}$
Definition and Types of
$ \overset <3180\gt\gt\mbox{\scriptsize int}{{\Join}$
Definition and Types of
h
Simple Temporal Hash Join
R'k
Improved Temporal Hash Join
R''k
Improved Temporal Hash Join
infimum
Preliminaries
R
Preliminaries
Q
Preliminaries
r
Preliminaries
q
Preliminaries
$\langle r_1,\dots,r_n \rangle$
Preliminaries
[ts,te]
Preliminaries
(ts,te]
Preliminaries
T(R)
Preliminaries
$t_{\min}$
Preliminaries
$t_{\max}$
Preliminaries
L(R)
Preliminaries
S(R)
Preliminaries
E(R)
Preliminaries
P
Preliminaries
pk
Preliminaries
m
Preliminaries
p0
Preliminaries
pm
Preliminaries
$s_{\scriptscriptstyle R}$
Preliminaries
$e_{\scriptscriptstyle R}$
Preliminaries
$i_{\scriptscriptstyle R}$
Preliminaries
$o_{\scriptscriptstyle R}$
Preliminaries
C
An Example
Proof:
IP-opt
Algorithm for Optimal Partitioning
IP-opt
Algorithm IP-opt
c(qi)
Algorithm for Optimal Partitioning
Algorithm for Optimal Partitioning
q0
Algorithm for Optimal Partitioning
Algorithm for Optimal Partitioning
SGP-opt
Optimal Solution for SGP
G=(V,A)
Sequential Graph Partitioning
X
Sequential Graph Partitioning
V
Sequential Graph Partitioning
vi
Sequential Graph Partitioning
Sequential Graph Partitioning
w(vi)
Sequential Graph Partitioning
l(vi,vj)
Sequential Graph Partitioning
A
Sequential Graph Partitioning
Vk
Sequential Graph Partitioning
Definition: Sequential Graph Partitioning SGP
Ak
Definition: Sequential Graph Partitioning SGP
A'
Definition: Sequential Graph Partitioning SGP
V
Reducing IP to SGP
G=(V,A)
Reducing IP to SGP
Vk
Reducing IP to SGP
M
Reducing IP to SGP
G=(V,A)
Definition:
V
Definition:
A
Definition:
w(vi)
Definition:
l(vi,vj)
Definition:
Optimal Solution for SGP
Optimal Solution for SGP
IP-opt
Optimisation Process
I(R)
Definition: (complete) IP-table
V(R)
Definition: (complete) IP-table
$s_{\scriptscriptstyle R}$
Definition: (complete) IP-table
$o_{\scriptscriptstyle R}$
Definition: (complete) IP-table
now
Temporal-Specific Support
[ts,te]
Temporal-Specific Support
The Size of an
The Size of an
The Size of an
The Size of an
a
Condensation of IP-Tables
I'(R,a)
Condensation of IP-Tables
t'j
Condensation of IP-Tables
t'j
Condensation of IP-Tables
V'(R,a)
Condensation of IP-Tables
N'
Proof:
Proof:
Proof:
I''(R)
Endpoint IP-Tables
Endpoint IP-Tables
Endpoint IP-Tables
V''(R)
Endpoint IP-Tables
t''j
Endpoint IP-Tables
N''
Endpoint IP-Tables
f(j)
Endpoint IP-Tables
after join
Definition and Types of | Elementary Conditions | Elementary Joins
analysis of partitions
Optimisation Process
append-only characteristic
Sort-Merge Joins
architectural model
The Architectural Model
architecture
The Architectural Model | The Architectural Influence
assymmetry property
Overview
B-tree
Data-Structure-Assisted Joins
band-join
Optimisation Process
bar-period
Black-Out Preprocessing Strategy
basic fragment
Classification of Join Algorithms
basic minimum-overlaps strategy
A General Comparison between
basic underflow strategy
A General Comparison between
basic underflow strategywith b/o
A General Comparison between
basicminimum-overlaps strategy with b/o
A General Comparison between
Bc-tree
Data-Structure-Assisted Joins
before join
The Significance of the | Definition and Types of | Elementary Conditions | Elementary Joins
bitmap index
Data-Structure-Assisted Joins
black-out preprocessing
Black-Out Preprocessing Strategy | A General Comparison between | A General Comparison between | Impact of Black-Out Preprocessing
black-out threshold
see Y
breakpoint
An Example | Preliminaries | Problem Definition | Search Space | Preliminaries
brute force nested-loops join
see nested-loops join
cardinality
Definition of the Join
cartesian product
Definition of the Join | Join Performance Issues | Brute Force Nested-Loops Joins | Sort-Merge Joins | Symmetric Partitioning Technique
cartesianproduct
Brute Force Nested-Loops Joins | Overview
catalog
Optimisation Process | IP-Tables | Maintaining IP-Tables
change_lengths()
The Basic Data Set | Dependency on | Manipulation of Interval Lengths
chronon
Basic Concepts and Notations | Basic Concepts and Notations | Basic Concepts and Notations | Basic Concepts and Notations | Basic Concepts and Notations | Stage 2: Joining | Uniform Workloads | Uniform Workloads | Uniform Strategies | The Basic Data Set | Manipulation of Interval Lengths
collection
Preliminaries
composite condition
Composite Conditions | Composite Joins
composite join
Composite Conditions | Composite Joins
concatenation
Definition of the Join | Stage 2: Joining
condensation
Condensation of IP-Tables | Uniform Range Partitioning | Black-Out Preprocessing Strategy | Experimental Evaluation | Influence of the Condensation a | Experiments on the Parallel | Conclusions | Future Work
condensation factor
Condensation of IP-Tables | Influence of the Condensation a
contain join
Definition and Types of | Overview | Composite Conditions | Composite Joins
conventional database
Temporal-Specific Support
cost model
Optimisation Process | Cost Model
data analysis
Optimisation Process | IP-Tables
data mining
Motivation | Introduction
data partitioning
Motivation
data sample
IP-Tables | The Size of an
data sampling
Optimisation Process | The Size of an
data skew
Hash Joins | Fragment-And-Replicate Technique | Improved Temporal Hash Join | Uniform Workloads | Conclusions | Experimental Evaluation | Introduction | Dependency on |R| and |Q| | The Architectural Influence
data warehouse
Temporal Databases and Data | Significance of Temporal Joins
data warehousing
Motivation | Temporal Databases and Data
datasample
Optimisation Process
dataskew
Hash Joins | Shared-Nothing | Conclusions
DBMS
Temporal-Specific Support
DDL
Temporal Database Management Systems
decision support system
Temporal Databases and Data | Temporal Databases and Data | Significance of Temporal Joins | Introduction
degree of overlap
Classification of Join Algorithms
deletion
Temporal and Conventional Databases | Maintaining Complete IP-Tables | Maintaining Condensed IP-Tables | Maintaining Endpoint IP-Tables
DEPT
Realistic Examples
discreteness
Basic Concepts and Notations
distributed shared memory
Shared-Memory | Shared-Disk
DML
Temporal Database Management Systems
domain vector
Data-Structure-Assisted Joins
DSS
see decision support system
duplicates overhead
Overview | Overview | Simple Temporal Hash Join | Simple Temporal Hash Join | Summary | Conclusions
duplicatesoverhead
Improved Temporal Hash Join
during join
Definition and Types of | Overview | Composite Conditions | Composite Joins
DW
see data warehouse
elementary condition
Elementary Conditions | Elementary Joins
elementary join
Elementary Conditions | Elementary Joins
entity-relationship model
The Significance of the
EPCC
Realistic Examples | The Basic Data Set
equal join
Definition and Types of | Composite Conditions
equaljoin
Composite Joins
equi-join
An Example | The Significance of the | Types of Joins | Symmetric Partitioning Technique
Erlang-n distribution
Summary
evaluation
Experimental Evaluation
f-a-r
see fragment-and-replicate
finish join
Definition and Types of | Elementary Conditions
finishjoin
Elementary Joins
first normal form
Basic Concepts and Notations
foreign key
The Significance of the
fragment
An Example | Symmetric Partitioning Technique | Problem Definition | Motivation
fragment, basic
Classification of Join Algorithms
fragment-and-replicate
Fragment-And-Replicate Technique | Overview | Spatially Partitioned Temporal Join
FRANKFURT
Realistic Examples
gap
Uniform Range Partitioning
geographic informationsystem
see GIS
GIS
Motivation | Types of Joins
GP
Alternative: Reducing IP to
Grace hash join
Hash Joins
granularity
Basic Concepts and Notations
graph partitioning
Alternative: Reducing IP to
hash bucket
Hash Joins
hash buffer
Stage 1: Repartitioning
hash function
Simple Temporal Hash Join
hash join
Hash Joins | Symmetric Partitioning Technique
hashing
Hash Joins
hashtable
Hash Joins
histogram
Histograms and IP-Tables
historical database
Temporal Databases and Data
hybrid architecture
A Hybrid Architecture
I/Obandwidth
Motivation
I/Oparallelism
Motivation
index join
Data-Structure-Assisted Joins | Data-Structure-Assisted Joins
inner relation
Brute Force Nested-Loops Joins
insertion
Maintaining Complete IP-Tables | Maintaining Condensed IP-Tables | Maintaining Endpoint IP-Tables | Merging IP-Tables
instant
Basic Concepts and Notations | Basic Concepts and Notations
inter-node replication
Stage 1: Repartitioning
intersection (ofjoins)
Composite Joins
intersection join
An Example | Definition and Types of | Overview | Composite Conditions | Parallel and Other Partitioned
intersectionjoin
Composite Joins
intersects
Temporal-Specific Support
interval
Motivation | Basic Concepts and Notations | Basic Concepts and Notations | Basic Concepts and Notations | Basic Concepts and Notations | Types of Joins | Preliminaries
closed
Basic Concepts and Notations
open
Basic Concepts and Notations
right-open
Basic Concepts and Notations
interval length
Manipulation of Interval Lengths
interval partitioning
Problem Definition | Definition: Interval Partitioning - IP
interval timestamp
Basic Concepts and Notations | Definition and Types of
interval,left-open
Basic Concepts and Notations
intervalpartitioning
Introduction
IP
Introduction | Problem Definition | IP-Tables
IP-graph
Run-Time Complexity Analysis
IP-table
Optimisation Process | IP-Tables | IP-Tables | Definition: (complete) IP-table
complete
Definition: (complete) IP-table | Definition: (complete) IP-table | Maintaining Complete IP-Tables | Merging Complete IP-Tables
condensed
Condensation of IP-Tables | Maintaining Condensed IP-Tables | Merging Incomplete IP-Tables | Variations
endpoint
Endpoint IP-Tables | Maintaining Endpoint IP-Tables | Merging Incomplete IP-Tables | Variations
incomplete
Merging IP-Tables | Merging Incomplete IP-Tables
IP-table size
The Size of an
IP-table, maintenance
Maintaining IP-Tables
IP-tables, merging
Merging IP-Tables
join
An Example | Definition of the Join
after
see after join
band-
see band-join
before
see before join
composite
see composite join
contain
see contain join
during
see during join
elementary
see elementary join
equal
see equal join
equi-
see equi-join
finish
see finish join
hash
see hash join
index
see index join
intersection
see intersection join
left-overlap
see left-overlap join
meet
see meet join
nested-block
see nested-block join
nested-loop
see nested-loop join
nonequi-
see nonequi-join
overlap
see overlap join
parallel
see paralleljoin
partial
see partial join
right-overlap
see right-overlap join
sort-merge
see sort-merge join
spatial
see spatial join
star-
see star-join
start
see start join
temporal
see temporal join
theta-
see theta-join
join algorithms
Sequential Join Algorithms
join attributes
Definition of the Join
join classification
Classification of Join Algorithms
join condition
An Example | Definition of the Join | The Significance of the | Types of Joins | Definition and Types of | Stage 2: Joining | Temporal Join Conditions
join index
Data-Structure-Assisted Joins | Data-Structure-Assisted Joins
join selectivity
Introduction
join types
Types of Joins
joining stage
Symmetric Partitioning Technique | Preliminaries | Temporal Join Processing | Stage 2: Joining | Stage 2: Joining
joinselectivity
Brute Force Nested-Loops Joins
kd-tree
Data-Structure-Assisted Joins
key
The Significance of the
key = foreign keyrelationships
The Significance of the
Kolmogorov test
The Size of an
Kolmogorov teststatistic
Optimisation Process
left-overlap join
Definition and Types of | Elementary Conditions | Elementary Joins
lifespan
Preliminaries | Uniform Strategies | Uniform Strategies | Uniform Strategies
lifespan partitioning
Uniform Lifespan Partitioning | A General Comparison between
load balance
Fragment-And-Replicate Technique | Introduction | Shared-Memory | Conclusions | Underflow Strategies | Dependency on m | Dependency on | Influence of the Condensation a | Impact of Black-Out Preprocessing | Impact of Black-Out Preprocessing | Impact of Black-Out Preprocessing | Impact of Black-Out Preprocessing | Conclusions
load imbalance
Shared-Nothing
logical replication
Overview | Introduction
logicaldeletion
Temporal and Conventional Databases
matching stage
Classification of Join Algorithms
meet join
Definition and Types of | Elementary Conditions | Elementary Joins
merging (IP-tables)
Merging IP-Tables
merging stage
Symmetric Partitioning Technique | Temporal Join Processing
metadata
Temporal-Specific Join Optimisation Issues | Definition: (complete) IP-table | Introduction
min-max dilemma
Introduction
minimum-overlaps strategy
Minimum-Overlaps Strategies | A General Comparison between
natural join, valid-time
Definition and Types of
natural time-join
Definition and Types of
nested-block join
Stage 2: Joining
nested-blockjoin
Brute Force Nested-Loops Joins
nested-loop join
Brute Force Nested-Loops Joins | Nested-Loop Temporal Joins
nested-loopjoin
Symmetric Partitioning Technique
network data model
The Significance of the
non-periodic profile
The Basic Data Set
nonequi-join
The Significance of the | Types of Joins | Symmetric Partitioning Technique
normalisation
The Significance of the
now
Basic Concepts and Notations
NUMA
Shared-Memory | A Hybrid Architecture
object-oriented data model
The Significance of the
operational database
Temporal Databases and Data
optimal partition
Introduction | Introduction | Problem Definition | Definition: Interval Partitioning - IP | Search Space | Proof: | Proof: | Optimal Partitioning | Endpoint IP-Tables
optimalpartition
Research Goal | Search Space | Proof: | Motivation | Proof:
optimisation
Optimisation of Partitioned Temporal | Optimisation Process
outer relation
Brute Force Nested-Loops Joins
overlap join
Definition and Types of | Composite Conditions | Composite Joins
overlap, complete
Classification of Join Algorithms
overlap, disjoint
Classification of Join Algorithms
overlap, minimum
Classification of Join Algorithms
overlap, no
Classification of Join Algorithms
overlap, variable
Classification of Join Algorithms
parallel architecture
The Architectural Influence
parallel join
An Example | Hash Joins | Parallel Joins
parallelnested-loop join
Symmetric Partitioning Technique
partial join
Symmetric Partitioning Technique | Improved Temporal Hash Join | Parallel and Other Partitioned
partial selectivity
Stage 2: Joining
partialjoin
Hash Joins
partition
Preliminaries | Preliminaries
partition range
Preliminaries | Problem Definition | Motivation | Preliminaries
partitioning
Classification of Join Algorithms | A Short Summary | A Short Summary | Problem Definition
explicit
Classification of Join Algorithms | Overview | Explicit-Partitioning Join Algorithms
fragment-and-replicate
see fragment-and-replicate
graph
see graphpartitioning
implicit
Classification of Join Algorithms
interval
see interval partitioning
lifespan
see lifespan partitioning
no
Classification of Join Algorithms
precomputed
Classification of Join Algorithms
range
see range partitioning
sequential graph
see sequential graphpartitioning
spatial
Spatially Partitioned Temporal Join | A Short Summary
startpoints' span
see startpoints' span partitioning
symmetric
see symm. partitioning | Spatially Partitioned Temporal Join
typesof
Classification of Join Algorithms
uniform
see uniform partitioning
partitioning stage
Symmetric Partitioning Technique | Classification of Join Algorithms | Preliminaries | Temporal Join Processing | Stage 1: Repartitioning | Stage 1: Repartitioning
partitioning strategies
Optimisation Process | Optimisation Process | Partitioning Strategies
performance
Join Performance Issues
performance model
Optimisation Process | Performance Model
period
see interval
periodic profile
The Basic Data Set
physicaldeletion
Temporal and Conventional Databases
physicalreplication
Overview | Introduction
Poisson distribution
Summary
polygon
Types of Joins
primary minimum-overlaps strategy
Dependency on XR and XQ | Dependency on
primary minimum-overlapsstrategy
A General Comparison between
primary tuples
Improved Temporal Hash Join | Partitioned Temporal Join for
primary underflow strategy
A General Comparison between | Dependency on XR and XQ | Dependency on
primary underflow strategywith b/o
A General Comparison between
primaryminimum-overlaps strategy with b/o
A General Comparison between
processing overhead
Overview | Simple Temporal Hash Join | Summary
profile
The Basic Data Set | The Basic Data Set
query optimisation
Temporal-Specific Support | Introduction
rand()
The Basic Data Set
range
Preliminaries | Uniform Strategies | Uniform Strategies | Uniform Strategies
range partitioning
A Short Summary | Uniform Range Partitioning | A General Comparison between
rangepartitioning
Simple Temporal Hash Join
rectangle
Types of Joins
reduction
Reducing IP to SGP
repartitioning stage
Temporal Join Processing | Stage 1: Repartitioning | Stage 1: Repartitioning
repartitioningstage
Preliminaries
replicated tuples
Improved Temporal Hash Join | Partitioned Temporal Join for
replication
Fragment-And-Replicate Technique | Introduction
replication overhead
Overview | Summary
right-overlap join
Definition and Types of | Elementary Conditions | Elementary Joins
rocking
Brute Force Nested-Loops Joins
same time as
Temporal-Specific Support
SD
Shared-Disk
search space
Search Space
segment
Preliminaries | Uniform Strategies
selectivity
Brute Force Nested-Loops Joins | Symmetric Partitioning Technique | Introduction
selectivity estimation
Temporal-Specific Join Optimisation Issues | Using IP-Tables for Selectivity
selectivity factor
Stage 2: Joining | Introduction
selectivityfactor
Brute Force Nested-Loops Joins
semantic datamodel
The Significance of the
semantic optimisation
Temporal-Specific Support
sequential graph partitioning
Alternative: Reducing IP to | Sequential Graph Partitioning
SGP
Alternative: Reducing IP to | Sequential Graph Partitioning
shared-disk
Summary of the Architectural | Shared-Disk | A Hybrid Architecture
shared-everything
Shared-Memory
shared-memory
Introduction | Summary of the Architectural | Shared-Memory | Shared-Disk | A Hybrid Architecture
shared-nothing
Introduction | Summary of the Architectural | Shared-Nothing | A Hybrid Architecture
simple hash join
Hash Joins
simulation
Outline
simultaneity
Temporal-Specific Support
SM
Shared-Memory
SMP
Introduction | Shared-Memory | A Hybrid Architecture
SN
Shared-Nothing
snapshot
Temporal and Conventional Databases
snapshotdatabase
Temporal and Conventional Databases
sort-merge join
Sort-Merge Joins | Sort-Merge Joins
sorting
A Short Summary
span
Preliminaries | Uniform Strategies
spatial data types
Types of Joins
spatial join
Types of Joins | Spatially Partitioned Temporal Join
spatial join condition
Types of Joins
spatial partitioning
A Short Summary
speed-up
Dependency on m
SQL/Temporal
Research on Temporal Databases
SQL3
Research on Temporal Databases
star-join
Fragment-And-Replicate Technique
start join
Definition and Types of | Elementary Conditions | Elementary Joins
startpoint
Basic Concepts and Notations
startpoints' span
Uniform Strategies | Uniform Strategies | Uniform Strategies | Uniform Startpoints' Span Partitioning
startpoints' span partitioning
Uniform Startpoints' Span Partitioning | A General Comparison between
strategy
Partitioning Strategies
STUD
Realistic Examples
subjoin
Stage 2: Joining
surrogate
Data-Structure-Assisted Joins
symmetric multiprocessor
Shared-Memory | A Hybrid Architecture
symmetric partitioning
Symmetric Partitioning Technique | Overview | Partitioning Strategies
synthesis of partitions
Optimisation Process
T-join
Definition and Types of
T-tree
Data-Structure-Assisted Joins
TDBMS
Temporal Database Management Systems
TE-join
Definition and Types of
temporal data
Temporal Databases
temporal data model
Temporal Database Management Systems
temporal data types
Types of Joins
temporal database
Temporal Databases | Temporal Databases | Temporal Databases and Data
temporal databasemanagement system
Temporal Database Management Systems
temporal join
The Significance of the | Types of Joins | Temporal Join Processing | Definition and Types of
temporal join condition
Types of Joins | Definition and Types of | Temporal Join Conditions
temporal join processing model
Temporal Join Processing Model
temporal query language
Temporal Database Management Systems
temporal relation
Basic Concepts and Notations | Basic Concepts and Notations
temporal semantics
Temporal-Specific Support
temporaljoin
An Example
temporalrelation
An Example
theta operator
Types of Joins
theta-join
Types of Joins
time domain
Basic Concepts and Notations | Basic Concepts and Notations | Basic Concepts and Notations
time index
Data-Structure-Assisted Joins
time line
Basic Concepts and Notations
time-concatenation
Stage 2: Joining
time-intersection equi-join
Definition and Types of
time-join
Definition and Types of
timecube
Temporal and Conventional Databases
timepoint
Basic Concepts and Notations | Basic Concepts and Notations | Basic Concepts and Notations | Basic Concepts and Notations | Preliminaries
timeslice
Temporal and Conventional Databases
timestamp
An Example | Synthetical Part | Temporal-Specific Support | Temporal-Specific Support | Temporal-Specific Support | Basic Concepts and Notations | Basic Concepts and Notations | Temporal and Conventional Databases | The Significance of the | Types of Joins | Definition and Types of | Definition and Types of | Definition and Types of | Definition and Types of | Significance of Temporal Joins | Sort-Merge Joins | Data-Structure-Assisted Joins | Simple Temporal Hash Join | Simple Temporal Hash Join | Improved Temporal Hash Join | Improved Temporal Hash Join | Spatially Partitioned Temporal Join | Introduction | Problem Definition | Definition: (complete) IP-table | Definition: (complete) IP-table | Definition: (complete) IP-table | Realistic Examples | Maintaining IP-Tables | Maintaining Condensed IP-Tables | Merging IP-Tables | Preliminaries | Stage 1: Repartitioning | Stage 1: Repartitioning | Stage 1: Repartitioning | Stage 2: Joining | Stage 1: Repartitioning | Uniform Workloads | Conclusions | Introduction | Introduction | A General Comparison between | Introduction | Elementary Conditions | Composite Conditions | Elementary Joins | Elementary Joins | Elementary Joins | Composite Joins | Composite Joins | Parallel and Other Partitioned | Parallel and Other Partitioned | Parallel and Other Partitioned | Summary | Summary | Summary | Conclusions
timestamped attributes
Basic Concepts and Notations
timestamped tuples
Basic Concepts and Notations
transaction time
Temporal-Specific Support | Sort-Merge Joins | Introduction
transactiontime
Temporal and Conventional Databases
trend analysis
Significance of Temporal Joins
TSQL2
Research on Temporal Databases
UMA
Shared-Memory
underflow strategy
Underflow Strategies | A General Comparison between
uniform lifespan strategy
Uniform Lifespan Partitioning | A General Comparison between | Dependency on
uniform partitioning
Uniform Strategies
uniform range strategy
Uniform Range Partitioning | A General Comparison between
uniform startpoints span strategy
Uniform Startpoints' Span Partitioning | A General Comparison between
uniform strategies
Uniform Strategies
uniform workload
Uniform Workloads
union (of joins)
Composite Joins
update (IP-table)
Maintaining IP-Tables
valid time
Temporal and Conventional Databases | Introduction


Thomas Zurek