2001
DOI: 10.1109/69.908979
|View full text |Cite
|
Sign up to set email alerts
|

A foundation for conventional and temporal query optimization addressing duplicates and ordering

Abstract: AbstractÐMost real-world databases contain substantial amounts of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database applications may benefit substantially from built-in temporal support in the DBMS. To achieve this, temporal query representation, optimization, and processing mechanisms must be provided. This paper presents a foundation for query optimization that integrates conventional and temporal query optimization and is suitable for both conventional D… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2005
2005
2012
2012

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 12 publications
(10 citation statements)
references
References 23 publications
0
10
0
Order By: Relevance
“…In StreamAPAS, we develop a stream database which adapts the basis of relational databases and temporal databases [12,13,14] because they are also oriented towards processing ordered data. In contrast to other systems, our system processes both temporal positive tuples and the negative ones in a unitemporal stream model.…”
Section: Resultsmentioning
confidence: 99%
“…In StreamAPAS, we develop a stream database which adapts the basis of relational databases and temporal databases [12,13,14] because they are also oriented towards processing ordered data. In contrast to other systems, our system processes both temporal positive tuples and the negative ones in a unitemporal stream model.…”
Section: Resultsmentioning
confidence: 99%
“…Temporal databases, which store additional timestamps for describing an entry's validity and input time [29], describe temporal evolution of objects by multiple entries having adjacent valid times. To the best of our knowledge, in such temporal databases, like described in [30] and [4], duplicate detection is simplified to enable eliminating identical entries originating, e. g., from join-operators. We evaluate Slivinskas et al [4] explicitly proposing a temporal relational algebra handling such duplicate entries being characterized by identical properties with overlapping validity.…”
Section: Survey Of Duplicate Detection Methodsmentioning
confidence: 99%
“…To the best of our knowledge, in such temporal databases, like described in [30] and [4], duplicate detection is simplified to enable eliminating identical entries originating, e. g., from join-operators. We evaluate Slivinskas et al [4] explicitly proposing a temporal relational algebra handling such duplicate entries being characterized by identical properties with overlapping validity. However, besides temporality, fuzzy information, object evolution, as well as context information are not discussed.…”
Section: Survey Of Duplicate Detection Methodsmentioning
confidence: 99%
See 2 more Smart Citations