Concept of Temporal Data Retrieval Undefined Value Management

Kvet, Michal

doi:10.1007/978-3-319-93408-2_5

Cited by 2 publications

(7 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An intermediate level between mentioned approaches is a hybrid approach, which can manage either attribute granularity itself but can also form a synchronized group. Group itself can be created either automatically using initialization parameters bordering but also manually …”

Section: Architecture: State Of the Artmentioning

confidence: 99%

“…Undef_object uses pointers; thus, for undefined Date value representation, only 1 byte is necessary. Further performance study and reference can be found in our previously released papers …”

Section: Own Solution‐dataobjtime Undeftypevalue Database Objectmentioning

confidence: 99%

“…Current database approaches do not have any robust and complex classification in terms of time definition and consecutive undefined value or state management. In 2014, simple classification has been introduced; however, its emphasis is only on database system type and transaction management. Our currently proposed solution comes deeper to the database structure, as well as index definition, location, and security management.…”

Section: Temporality and State Classificationmentioning

confidence: 99%

See 2 more Smart Citations

Concept of temporal data retrieval: Undefined value management

Kvet

Toth

Kršák

2019

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Summary Data reliability is the main part of the intelligence of current information systems. Objects can change their status anytime, highlighting the validity frame. Several solutions and architectures have been developed in the recent past to cover the complexity of data management over the whole life cycle. The common and most significant aspect is just the validity and correctness of the stored data tuples. Solutions, where data were updated always synchronously in strictly defined time points, frequency, and granularity, are over. Therefore, it is inevitable to create a solution suitable for the particular system to reach the best performance. We reference an attribute‐oriented temporal model with reflection on data grouping technologies. Many times, there is a case, during which the object is defined only partially or data tuple is not present at all. For these reasons, undefined values must be stored in the database in the form of time itself or attribute expressing the state of the object. This paper deals with time‐oriented database architectures, manages undefined values, and proposes a complex system classification based on transactions, approaches, and indexes. It deals with techniques to model undefined values and covers synchronization processes using data groups. We propose solutions for effective data retrieval with an emphasis on undefined values and states.

show abstract

Section: Architecture: State Of the Artmentioning

confidence: 99%

Section: Own Solution‐dataobjtime Undeftypevalue Database Objectmentioning

confidence: 99%

Section: Temporality and State Classificationmentioning

confidence: 99%

See 1 more Smart Citation

Concept of temporal data retrieval: Undefined value management

Kvet

Toth

Kršák

2019

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…Data reliability with temporal data retrieval was discussed in the article . The authors referenced an attribute‐oriented temporal model with reflection on data grouping technologies.…”

mentioning

confidence: 99%

“…Full Table Scan could be the skipped and data could be accessed directly using the index ROWID locators.Data reliability with temporal data retrieval was discussed in the article. 6 The authors referenced an attribute-oriented temporal model with reflection on data grouping technologies. The article dealt with time-oriented database architectures, where all undefined values were managed.…”

mentioning

confidence: 99%

Editorial on Innovative Network Systems and Applications together with the Conference on Information Systems Innovations for Community Services

Hodoň

Furtak

Fahrnberger

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

The purpose of this special issue is to assemble a selection of best research articles that were presented within the 6th International Conference on Innovative Network Systems and Applications (iNetSApp'18), 1 which was organized under the Federated Conference on Computer Science and Information Systems 2018 (FedCSIS'18), 2 which was held in the Polish city Pozna ń. According to the FedCSIS policy, 23% acceptance rate was kept in all regular paper submissions with the help of the well-structured and experienced conference program committee. Since only the little amount of papers met the quality for the publication in this special issue, other selected best papers from the 18th International Conference on Innovations for Community Services (I4CS 2018), 3 which was held in Žilina, Slovakia, were selected for the publication. For this special issue, only the papers with best review score were selected, thus the quality of the CPE series can be conserved.This special issue focuses on different applications and algorithm developments in the area of modern network systems which encompass a wide range of solutions and technologies, including wireless and wired networks, network systems, services, and applications. The scope of this special issue is broad, aiming at different results in numerous active research areas oriented toward various technical, scientific, and social aspects of network systems and applications. This is supplied by the recent advances in the theory and practice in a wide range of aspects of Internet community services, especially of how community services can be used in many areas and how they have been deployed.The authors in Reference 4 focused on the improvements of the convergence time in IP networks. They introduced a new kind of IP fast re-route (IPFRR) mechanism called the multicast repair (MREP) IPFRR mechanism, which provides an advanced fast reroute technique for Internet service providers' core networks. The M-REP IPFRR mechanism is based on IP multicast and utilizes Protocol Independent Multicast-Dense Mode with the modification of an internal reverse path forwarding check. The M-REP IPFRR mechanism does not depend on any particular routing protocol type (distance-vector or link-state) and requires less system resources because of its precomputation-less character but still provides immediate reaction to failure.The article 5 dealt with the problematic of the work with the large datasets. The article proposed a Flower Index Approach as the method for dealing with the data processing. With this approach, it was possible to remove the impact of the High-Water Mark, as well as to remove useless block loading with no relevant data. On the other hand, it provided effective data access stream using a specific index. Full Table Scan could be the skipped and data could be accessed directly using the index ROWID locators.Data reliability with temporal data retrieval was discussed in the article. 6 The authors referenced an attribute-oriented temporal model with reflection on data grouping tech...

show abstract

Concept of Temporal Data Retrieval Undefined Value Management

Cited by 2 publications

References 6 publications

Concept of temporal data retrieval: Undefined value management

Concept of temporal data retrieval: Undefined value management

Editorial on Innovative Network Systems and Applications together with the Conference on Information Systems Innovations for Community Services

Contact Info

Product

Resources

About