Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Valid time

Known as: Valid-time 
In temporal databases, valid time (VT) is the time period during which a database fact is valid in the modeled reality. As of December 2011, ISO/IEC… Expand
Wikipedia

Related topics

Related topics

4 relations
SQL:2011Slowly changing dimensionTemporal databaseTransaction time

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Representation and Querying of Valid Time of Triples in Linked Geospatial Data
We introduce the temporal component of the stRDF data model and the stSPARQL query language, which have been recently proposed… Expand
  • figure 1
  • figure 2
  • figure 3
2008
2008
Optimal reachability for multi-priced timed automata
In this paper, we prove the decidability of the minimal and maximal reachability problems for multi-priced timed automata, an… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2008
Highly Cited
2008
Data Warehousing and Mining : Concepts , Methodologies , Tools , and Applications
Data warehousing and mining : concepts, methodologies, tools and applications / John Wang, editor. p. cm. Summary: "This… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
2006
2006
Using XML to Build Efficient Transaction-Time Temporal Database Systems on Relational Databases
In this paper, we present the ArchIS system that achieves full-functionality transaction-time databases without requiring… Expand
  • table 1
  • table 2
  • figure 3
  • figure 4
  • figure 6
Highly Cited
2005
Highly Cited
2005
Temporal RDF
The Resource Description Framework (RDF) is a metadata model and language recommended by the W3C. This paper presents a framework… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2005
Highly Cited
2005
Optimal Conditional Reachability for Multi-priced Timed Automata
In this paper, we prove decidability of the optimal conditional reachability problem for multi-priced timed automata, an… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Highly Cited
1999
Highly Cited
1999
Capturing and Querying Multiple Aspects of Semistructured Data
Motivated to a large extent by the substantial and growing prominence of the World-Wide Web and the potential benefits that may… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
1999
1999
Indexing Valid Time Databases via B+-Trees
We present an approach, named MAP21, which uses standard B/sup +/-trees to provide efficient indexing of valid time ranges. The… Expand
Highly Cited
1998
Highly Cited
1998
Supporting valid-time indeterminacy
In valid-time indeterminacy it is known that an event stored in a database did in fact occur, but it is not known exactly when… Expand
  • figure 1
  • figure 4
  • figure 5
  • table I
  • table II
Highly Cited
1996
Highly Cited
1996
Adding Valid Time to SQL/Temporal
This change proposal specifies the addition of tables with valid-time support into SQL/Temporal, and explains how to use these… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE