Skip to main content
Log in

Building a Data Store with the Dynamic Structure

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

This article presents the analysis of approaches to data warehouse construction based on relational and NoSQL solutions and lists the limitations of the relational approach to data mining. The contradiction between data presentation in the real subject domain and the model of data presentation in the relational and NoSQL approaches is revealed. The revealed contradiction is related to the temporality of the values of individual data attributes, the variability of the composition of these attributes, and structure of connections between them. A new logical model of the data warehouse with dynamic structure is proposed. The model is based on the concept of the object as a container for properties storage. Each property of the object includes the property name and two property values—without reference and with reference, that are relevant at a given time. The reference property value points to an object whose name is interpreted as the value of the property at a given time. A formal description of the model with allocation of the necessary functionality to manipulate objects and their properties (selectors, predicates, constructors) is given and the necessary control structures are introduced. Substantiation of the proposed model, called an OP-model is given on the basis of compliance with the logical ER data model. It is proved that any ER data model can be implemented in the OP-model. At the same time, the advantages of the OP-model are indicated, they are associated with the possibility of changing connections between entities due to changes in the reference value at a particular time. The potential for scalability of data warehouse due to the unique identification of each object is noted.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.

Similar content being viewed by others

REFERENCES

  1. Barsegjan, A.A., Tekhnologii analiza dannyh: Data Mining, Visual Mining, Text Mining, OLAP (Data Analysis Technologies: Data Mining, Visual Mining, Text Mining, and OLAP), St. Petersburg: BHV-Peterburg, 2007.

  2. Date, C.J., An Introduction to Database Systems, Addison-Wesley Publishing Company, 1995.

    MATH  Google Scholar 

  3. Martin, J., Computer Data-Base Organization, New Jersey: IBM Systems Research Institute, 1977.

    Google Scholar 

  4. Connolly, T.M. and Begg, C.E., Database Systems: A Practical Approach to Design, Implementation, and Management, Pearson Education, 2005.

    MATH  Google Scholar 

  5. List of NoSQL Databases. http://nosql-database.org/.

  6. Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., and Toueg, S., Communication-efficient leader election and consensus with limited link synchrony, The Proceedings of the International Symposium on Principles of Distributed Computing (PODC), 2004, pp. 328–337.

  7. Herlihy, M. and Shavit, N., The topological structure of asynchronous computability, J. ACM, 1999, vol. 46, no. 6, pp. 858–923.

    Article  MathSciNet  Google Scholar 

  8. Haifeng, Y. and Amin, V., The costs and limits of availability for replicated services, ACM Trans. Comput. Syst., 2006, vol. 24, no. 1, pp. 70–113.

    Article  Google Scholar 

  9. Cooper, B.F., Ramakrishnan, R., Srivastava, U., Silberstein, A., Bohannon, P., Jacobsen, H.-A., Puz, N., Weaver, D., and Yerneni, R., Pnuts: Yahoo!'s hosted data serving platform, PVLDB, 2008, vol. 1, no. 2, pp. 1277–1288.

    Google Scholar 

  10. Swati Ahirrao and Rajesh Ingle, Scalable transactions in cloud data stores, J. Cloud Comput., 2015, vol. 4, p. 21.

  11. In-memory data structure store Redis. http://redis.io/.

  12. MongoDB Professional with Cloud Manager. https://www.mongodb.org/.

  13. A Database for the Web CouchDB. http://couchdb.apache.org/.

  14. Pisarenko, D.S. and Rublev, V.S., Object DBMS DIM and its main concepts, Model. Anal. Inf. Sist., 2009, vol. 16, no. 1, pp. 62–91.

    Google Scholar 

  15. Rublev, V.S., The object query language of the dynamic information model DIM, Model. Anal. Inf. Sist., 2010, vol. 17, no. 3, pp. 144–161.

    Google Scholar 

  16. Roublev, V.S., Evolution of DBMS DIM database schemes, Model. Anal. Inf. Sist., 2012, vol. 19, no. 2, pp. 97–108.

    Article  Google Scholar 

  17. Antonov, D.V. and Roublev, V.S., Access efficiency to data in DIM DBMS, Model. Anal. Inf. Sist., 2015, vol. 22, no. 2, pp. 158–175.

    Article  Google Scholar 

  18. Petrov, A.N. and Roublev, V.S., Completeness of the dynamics of the attributes values of data in the database DIM, Model. Anal. Inf. Sist., 2015, vol. 22, no. 2, pp. 259–277.

    Article  MathSciNet  Google Scholar 

  19. Roublev, V.S., Static completeness of the dynamic information model, Autom. Control Comput. Sci., 2015, vol. 49, no. 3, pp. 167–176.

    Article  Google Scholar 

  20. A Comprehensive Data Integration and Business Analytics Platform. http://www.pentaho.com/.

  21. Data Mining Software in Java. http://www.cs.waikato.ac.nz/ml/weka/.

  22. Doug, H., Let Over Lambda, 2010.

  23. Alexandros, B., An efficient database storage structure for large dynamic objects, Proceedings, IEEE Data Engineering Conference, Phoenix, Arizona, 1992, pp. 301–308.

  24. Poltavtsev, A.A., Dynamic structures in relation databases, Program. Prod. Sist., 2015, no. 2, pp. 95–97.

  25. Tsikritzis, D. and Lokhovski, F., Modeli dannykh (Data Models), Moscow: Finansy Stat., 1985.

  26. Kalinichenko, L.A., Metody i sredstva integratsii neodnorodnykh baz dannykh (Methods and Tools for Integration of Heterogeneous Databases), Moscow: Nauka, 1983.

Download references

Funding

This work was supported by the state task of the Ministry of Education and Science of the Russian under the project no. 2.87.2016/HM.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yu. N. Artamonov.

Ethics declarations

The authors declare that they have no conflicts of interest.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Artamonov, Y.N. Building a Data Store with the Dynamic Structure. Aut. Control Comp. Sci. 53, 794–810 (2019). https://doi.org/10.3103/S0146411619070265

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411619070265

Keywords:

Navigation