Academic literature on the topic 'Database management systems (DBMSs)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Database management systems (DBMSs).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Database management systems (DBMSs)"
1
Aljwari, Fatima Khalil. "External vs. Internal: An Essay on Machine Learning Agents for Autonomous Database Management Systems." European Journal of Computer Science and Information Technology 10, no. 5 (2022): 24–31. http://dx.doi.org/10.37745/ejcsit.2013/vol10n52431.
Full textAbstract:
There are many possible ways to configure database management systems (DBMSs) have challenging to manage and set.The problem increased in large-scale deployments with thousands or millions of individual DBMS that each have their setting requirements. Recent research has explored using machine learning-based (ML) agents to overcome this problem's automated tuning of DBMSs. These agents extract performance metrics and behavioral information from the DBMS and then train models with this data to select tuning actions that they predict will have the most benefit. This paper discusses two engineering approaches for integrating ML agents in a DBMS. The first is to build an external tuning controller that treats the DBMS as a black box. The second is to incorporate the ML agents natively in the DBMS's architecture.
2
Pavlo, Andrew, Matthew Butrovich, Lin Ma, et al. "Make your database system dream of electric sheep." Proceedings of the VLDB Endowment 14, no. 12 (2021): 3211–21. http://dx.doi.org/10.14778/3476311.3476411.
Full textAbstract:
Database management systems (DBMSs) are notoriously difficult to deploy and administer. Self-driving DBMSs seek to remove these impediments by managing themselves automatically. Despite decades of DBMS auto-tuning research, a truly autonomous, self-driving DBMS is yet to come. But recent advancements in artificial intelligence and machine learning (ML) have moved this goal closer. Given this, we present a system implementation treatise towards achieving a self-driving DBMS. We first provide an overview of the NoisePage self-driving DBMS that uses ML to predict the DBMS's behavior and optimize itself without human support or guidance. The system's architecture has three main ML-based components: (1) workload forecasting, (2) behavior modeling, and (3) action planning. We then describe the system design principles to facilitate holistic autonomous operations. Such prescripts reduce the complexity of the problem, thereby enabling a DBMS to converge to a better and more stable configuration more quickly.
3
Song, Jiansen, Wensheng Dou, Yu Gao, et al. "Detecting Metadata-Related Logic Bugs in Database Systems via Raw Database Construction." Proceedings of the VLDB Endowment 17, no. 8 (2024): 1884–97. http://dx.doi.org/10.14778/3659437.3659445.
Full textAbstract:
Database Management Systems (DBMSs) are widely used to efficiently store and retrieve data. DBMSs usually support various metadata, e.g., integrity constraints for ensuring data integrity and indexes for locating data. DBMSs can further utilize these metadata to optimize query evaluation. However, incorrect metadata-related optimizations can introduce metadata-related logic bugs, which can cause a DBMS to return an incorrect query result for a given query. In this paper, we propose a general and effective testing approach, Raw database construction (Radar), to detect metadata-related logic bugs in DBMSs. Given a database db containing some metadata, Radar first constructs a raw database rawDb , which wipes out the metadata in db and contains the same data as db. Since db and rawDb have the same data, they should return the same query result for a given query. Any inconsistency in their returned query results indicates a metadata-related logic bug. To effectively detect metadata-related logic bugs, we further propose a metadata-oriented testing optimization strategy to focus on testing previously unseen metadata, thus detecting more metadata-related logic bugs quickly. We implement and evaluate Radar on five widely-used DBMSs, and have detected 42 bugs, of which 38 have been confirmed as new bugs and 16 have been fixed by DBMS developers.
4
Carvalho, Nuno, Alfranio Jr., José Pereira, Luís Rodrigues, Rui Oliveira, and Susana Guedes. "On the Use of a Reflective Architecture to Augment Database Management Systems." JUCS - Journal of Universal Computer Science 13, no. (8) (2007): 1110–35. https://doi.org/10.3217/jucs-013-08-1110.
Full textAbstract:
The Database Management System (DBMS) used to be a commodity software component, with well known standard interfaces and semantics. However, the performance and reliability expectations being placed on DBMSs have increased the demand for a variety add-ons, that augment the functionality of the database in a wide range of deployment scenarios, offering support for features such as clustering, replication, and self-management, among others. A well known software engineering approach to systems with such requirements is reflection. Unfortunately, standard reflective interfaces in DBMSs are very limited. Some of these limitations may be circumvented by implementing reflective features as a wrapper to the DBMS server. Unfortunately, these solutions comes at the expense of a large development effort and significant performance penalty. In this paper we propose a general purpose DBMS reflection architecture and interface, that supports multiple extensions while, at the same time, admitting efficient implementations. We illustrate the usefulness of our proposal with concrete examples, and evaluate its cost and performance under different implementation strategies.
5
Camilleri, Carl, Joseph G. Vella, and Vitezslav Nezval. "HTAP With Reactive Streaming ETL." Journal of Cases on Information Technology 23, no. 4 (2021): 1–19. http://dx.doi.org/10.4018/jcit.20211001.oa10.
Full textAbstract:
In database management systems (DBMSs), query workloads can be classified as online transactional processing (OLTP) or online analytical processing (OLAP). These often run within separate DBMSs. In hybrid transactional and analytical processing (HTAP), both workloads may execute within the same DBMS. This article shows that it is possible to run separate OLTP and OLAP DBMSs, and still support timely business decisions from analytical queries running off fresh transactional data. Several setups to manage OLTP and OLAP workloads are analysed. Then, benchmarks on two industry standard DBMSs empirically show that, under an OLTP workload, a row-store DBMS sustains a 1000 times higher throughput than a columnar DBMS, whilst OLAP queries are more than 4 times faster on a columnar DBMS. Finally, a reactive streaming ETL pipeline is implemented which connects these two DBMSs. Separate benchmarks show that OLTP events can be streamed to an OLAP database within a few seconds.
6
Ansari, Sakil Ahmad, and Jaychand Vishwakarma. "Survey on Database Concurrency Control in Multilevel Secure Database Management Systems." International Journal of Advanced Research in Computer Science and Software Engineering 8, no. 4 (2018): 105. http://dx.doi.org/10.23956/ijarcsse.v8i4.645.
Full textAbstract:
Transactions are vital for database management systems (DBMSs) because they provide transparency to concurrency and failure. Concurrent execution of transactions may lead to contention for access to data, which in a multilevel secure DBMS (MLSIDBMS) may lead to insecurity. In this paper we examine security issues involved in database concurrency control for MLS/DBMSs and show how a scheduler can affect security. We introduce Data Conflict Security; (DC-Security) a property that implies a system is free of convert channels due to contention for access to data. We present a definition of DC Security based on noninterference. Two properties that constitute a necessary condition for DC-Security are introduced along with two other simpler necessary conditions. We have identified a class of schedulers we call Output-State-Equivalent for which another criterion implies DC-Security. The criterion considers separately the behavior of the scheduler in response to those inputs that cause rollback and those that do not. We characterize the security properties of several existing scheduling protocols and find many to be insecure
7
Zhong, Suyang, and Manuel Rigger. "Understanding and Reusing Test Suites Across Database Systems." Proceedings of the ACM on Management of Data 2, no. 6 (2024): 1–26. https://doi.org/10.1145/3698829.
Full textAbstract:
Database Management System (DBMS) developers have implemented extensive test suites to test their DBMSs. For example, the SQLite test suites contain over 92 million lines of code. Despite these extensive efforts, test suites are not systematically reused across DBMSs, leading to wasted effort. Integration is challenging, as test suites use various test case formats and rely on unstandardized test runner features. We present a unified test suite, SQuaLity, in which we integrated test cases from three widely-used DBMSs, SQLite, PostgreSQL, and DuckDB. In addition, we present an empirical study to determine the potential of reusing these systems' test suites. Our results indicate that reusing test suites is challenging: First, test formats and test runner commands vary widely; for example, SQLite has 4 test runner commands, while MySQL has 112 commands with additional features, to, for example, execute file operations or interact with a shell. Second, while some test suites contain mostly standard-compliant statements (e.g., 99% in SQLite), other test suites mostly test non-standardized functionality (e.g., 31% of statements in the PostgreSQL test suite are nonstandardized). Third, test reuse is complicated by various explicit and implicit dependencies, such as the need to set variables and configurations, certain test cases requiring extensions not present by default, and query results depending on specific clients. Despite the above findings, we have identified 3 crashes, 3 hangs, and multiple compatibility issues across four different DBMSs by executing test suites across DBMSs, indicating the benefits of reuse. Overall, this work represents the first step towards test-case reuse in the context of DBMSs, and we hope that it will inspire follow-up work on this important topic.
8
Gu, Long, Si Liu, Tiancheng Xing, Hengfeng Wei, Yuxing Chen, and David Basin. "IsoVista: Black-Box Checking Database Isolation Guarantees." Proceedings of the VLDB Endowment 17, no. 12 (2024): 4325–28. http://dx.doi.org/10.14778/3685800.3685866.
Full textAbstract:
Transactional isolation is critical to the functional correctness of database management systems (DBMSs). Much effort has recently been devoted to finding isolation bugs and validating isolation fulfilment in production DBMSs. However, there are still challenges that existing isolation checkers have not yet fully addressed. For instance, they may overlook bugs, incur high checking overhead, and return hard-to-understand counterexamples. We present IsoVista, the first black-box isolation checking system that encompasses all the following features. It builds on faithful characterizations of a range of isolation levels, ensuring the absence of both false positives and missed bugs in collected DBMS execution histories. IsoVista exhibits superior checking efficiency, compared to the state-of-the-art, and visualizes violation scenarios, facilitating the understanding of bugs found. It also supports profiling and benchmarking the performance of isolation checkers under various workloads, assisting developers of both DBMSs and checkers. We showcase all these features through user-friendly interfaces.
9
Taipalus, Toni, Hilkka Grahn, Hannu Turtiainen, and Andrei Costin. "Utilizing Vector Database Management Systems in Cyber Security." European Conference on Cyber Warfare and Security 23, no. 1 (2024): 560–65. http://dx.doi.org/10.34190/eccws.23.1.2220.
Full textAbstract:
The rising popularity of phenomena such as ubiquitous computing and IoT poses increasingly high demands for data management, and it is not uncommon that database management systems (DBMS) must be capable of reading and writing hundreds of operations per second. Vector DBMSs (VDBMS) are novel products that focus on the management of vector data and can alleviate data management pressures by storing data objects such as logs, system calls, emails, network flow data, and memory dumps in feature vectors that are computationally efficient in both storage and information retrieval. VDMBSs allow efficient nearest neighbour similarity search on complex data objects, which can be used in various cyber security applications such as anomaly, intrusion, malware detection, user behaviour analysis, and network flow analysis. This study describes VDBMSs and some of their use cases in cyber security.
10
Zhang, Chi, and Manuel Rigger. "Constant Optimization Driven Database System Testing." Proceedings of the ACM on Management of Data 3, no. 1 (2025): 1–24. https://doi.org/10.1145/3709674.
Full textAbstract:
Logic bugs are bugs that can cause database management systems (DBMSs) to silently produce incorrect results for given queries. Such bugs are severe, because they can easily be overlooked by both developers and users, and can cause applications that rely on the DBMSs to malfunction. In this work, we propose Constant-Optimization-Driven Database Testing (CODDTest) as a novel approach for detecting logic bugs in DBMSs. This method draws inspiration from two well-known optimizations in compilers: constant folding and constant propagation. Our key insight is that for a certain database state and query containing a predicate, we can apply constant folding on the predicate by replacing an expression in the predicate with a constant, anticipating that the results of this predicate remain unchanged; any discrepancy indicates a bug in the DBMS. We evaluated CODDTest on five mature and extensively-tested DBMSs--SQLite, MySQL, CockroachDB, DuckDB, and TiDB--and found 45 unique, previously unknown bugs in them. Out of these, 24 are unique logic bugs. Our manual analysis of the state-of-the-art approaches indicates that 11 logic bugs are detectable only by CODDTest. We believe that CODDTest is easy to implement, and can be widely adopted in practice.
Dissertations / Theses on the topic "Database management systems (DBMSs)"
1
Fredstam, Marcus, and Gabriel Johansson. "Comparing database management systems with SQLAlchemy : A quantitative study on database management systems." Thesis, Linköpings universitet, Interaktiva och kognitiva system, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-155648.
Full textAbstract:
Knowing which database management system to use for a project is difficult to know in advance. Luckily, there are tools that can help the developer apply the same database design on multiple different database management systems without having to change the code. In this thesis, we investigate the strengths of SQLAlchemy, which is an SQL toolkit for Python. We compared SQLite, PostgreSQL and MySQL using SQLAlchemy as well as compared a pure MySQL implementation against the results from SQLAlchemy. We conclude that, for our database design, PostgreSQL was the best database management system and that for the average SQL-user, SQLAlchemy is an excellent substitution to writing regular SQL.
2
Kanani, Saleh. "A method to evaluate database management systems for Big Data : focus on spatial data." Thesis, Luleå tekniska universitet, Datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-74172.
Full textAbstract:
Big data of type spatial is growing exponentially with the highest rate due to extensive growth in usage of sensors, IoT and mobile devices’ spatial data generation, therefore maintaining, processing and using such data efficiently, effectively with high performance has become one of the top priorities for Database management system providers, hence spatial database features and datatypes have become serious criteria in evaluating database management systems that are supposed to work as the back-end for spatial applications and services. With exponential growth of data and introducing of new types of data, “Big Data” has become strongly focused area that has gained the attention of different sectors e.g. academia, industries and governments to other organizations and studies. The rising trend in high resolution and large-scale geographical information systems have resulted in more companies providing location-based applications and services, therefore finding a proper database management system solution that can support spatial big data features, with multi-model big data support that is reliable and affordable has become a business need for many companies. Concerning the fact that choosing proper solution for any software project can be crucial due to the total cost and desired functionalities that any product could possibly bring into the solution. Migration is also a very complicated and costly procedure that many companies should avoid, which justifies the criticality of choosing the right solution based on the specific needs of any organization. Companies providing spatial applications and services are growing with the common concern of providing successful solutions and robust services. One of the most significant elements that ensures services’ and hence the providers’ reputation and positive depiction is services’ high availability. The possible future work for the thesis could be to develop the framework into a decision support solution for IT businesses with emphasize on spatial features. Another possibility for the future works would be to evaluate the framework by testing the evaluation framework on many other different DBMSs.
3
Lehner, Wolfgang. "Energy-Efficient In-Memory Database Computing." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-115547.
Full textAbstract:
The efficient and flexible management of large datasets is one of the core requirements of modern business applications. Having access to consistent and up-to-date information is the foundation for operational, tactical, and strategic decision making. Within the last few years, the database community sparked a large number of extremely innovative research projects to push the envelope in the context of modern database system architectures. In this paper, we outline requirements and influencing factors to identify some of the hot research topics in database management systems. We argue that—even after 30 years of active database research—the time is right to rethink some of the core architectural principles and come up with novel approaches to meet the requirements of the next decades in data management. The sheer number of diverse and novel (e.g., scientific) application areas, the existence of modern hardware capabilities, and the need of large data centers to become more energy-efficient will be the drivers for database research in the years to come.
4
Kernert, David. "Density-Aware Linear Algebra in a Column-Oriented In-Memory Database System." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-210043.
Full textAbstract:
Linear algebra operations appear in nearly every application in advanced analytics, machine learning, and of various science domains. Until today, many data analysts and scientists tend to use statistics software packages or hand-crafted solutions for their analysis. In the era of data deluge, however, the external statistics packages and custom analysis programs that often run on single-workstations are incapable to keep up with the vast increase in data volume and size. In particular, there is an increasing demand of scientists for large scale data manipulation, orchestration, and advanced data management capabilities. These are among the key features of a mature relational database management system (DBMS). With the rise of main memory database systems, it now has become feasible to also consider applications that built up on linear algebra.
This thesis presents a deep integration of linear algebra functionality into an in-memory column-oriented database system. In particular, this work shows that it has become feasible to execute linear algebra queries on large data sets directly in a DBMS-integrated engine (LAPEG), without the need of transferring data and being restricted by hard disc latencies. From various application examples that are cited in this work, we deduce a number of requirements that are relevant for a database system that includes linear algebra functionality. Beside the deep integration of matrices and numerical algorithms, these include optimization of expressions, transparent matrix handling, scalability and data-parallelism, and data manipulation capabilities. These requirements are addressed by our linear algebra engine. In particular, the core contributions of this thesis are: firstly, we show that the columnar storage layer of an in-memory DBMS yields an easy adoption of efficient sparse matrix data types and algorithms. Furthermore, we show that the execution of linear algebra expressions significantly benefits from different techniques that are inspired from database technology. In a novel way, we implemented several of these optimization strategies in LAPEG’s optimizer (SpMachO), which uses an advanced density estimation method (SpProdest) to predict the matrix density of intermediate results. Moreover, we present an adaptive matrix data type AT Matrix to obviate the need of scientists for selecting appropriate matrix representations. The tiled substructure of AT Matrix is exploited by our matrix multiplication to saturate the different sockets of a multicore main-memory platform, reaching up to a speed-up of 6x compared to alternative approaches. Finally, a major part of this thesis is devoted to the topic of data manipulation; where we propose a matrix manipulation API and present different mutable matrix types to enable fast insertions and deletes.
We finally conclude that our linear algebra engine is well-suited to process dynamic, large matrix workloads in an optimized way. In particular, the DBMS-integrated LAPEG is filling the linear algebra gap, and makes columnar in-memory DBMS attractive as efficient, scalable ad-hoc analysis platform for scientists.
5
Tolvaišis, Andrius. "DBVS praplėtimo nauju funkcionalumu galimybių tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100826_110401-00307.
Full textAbstract:
Duomenų bazių valdymo sistema (DBVS) yra pagrindas beveik visų šiuolaikinių informacinių sistemų (IS). Iš esmės kiekvienas verslo, mokslo arba valdžios valdymo procesas remiasi duomenų baze. Interneto plėtra tik paspartino šią tendenciją – šiandien duomenų bazių operacijos yra kiekvieno duomenų pakeitimo didesniuose tinklalapiuose, paieškos arba apsipirkimo internete variklis [1].
Šiuo metu rinkoje yra didelis komercinių ir nemokamų (taip pat ir atviro kodo) duomenų bazių valdymo sistemų (DBVS) pasirinkimas, pavyzdžiui: Oracle, Microsoft SQL Server, IBM DB2, Microsoft Access, MySQL, PostgreSQL. Kiekviena jų turi savo privalumų ir trukumų. Tačiau informacinių sistemų projektavimo eiga, naudojant šias DBVS ir neatsižvelgiant į jų ypatumus, yra panaši: suprojektuojama duomenų bazė (sukuriamos lentelės, nustatomi jų tarpusavio ryšiai), rašomos užklausos, kuriamos (arba generuojamos) duomenų įvedimo/redagavimo formos bei kuriamos duomenų išrinkimo ataskaitos. Ši informacinių sistemų kūrimo tvarka yra nusistovėjusi per daugelį metų. Tačiau DB projektavimo procesas taptų lengvesnis, pakeitus IS projektavimo procesą taip, kad realizacijos metu iš pradžių būtų kuriamos formos, o tik po to iš sukurtų formų būtų generuojama duomenų bazė. Toks IS kūrimo procesas leistų iš dalies automatizuotų DB projektavimą. Be to, galutinai suderinus prototipus su užsakovu, užtektų tik sugeneruoti DB, t.y. nereikėtų iš naujo kurti formų, o sistema sugeneruotų DB bei automatiškai susietų formų laukus... [toliau žr. visą tekstą]<br>The Data Base Management System (DBMS) is the foundation of almost every modern business information system. Virtually every administrative process in business, science or government relies on a database. There are a lot of DBMS products in our days, such as Oracle, Microsoft SQL Server, IBM DB2, Microsoft Access, MySQL and PostgreSQL. Each of it has their advantages and disadvantages. But the database design process using these DBMS is the same – at the first stage we need to create a database (tables and relationships between them), then we need to create (or generate by using wizard) forms for data input/modification and reports for data selection. However, the database design process would become easier by changing database design process in such a way that at first we create forms and then database is generated from forms data and forms are automatically associated with database tables. The task of research is to extend chosen free open source DBMS by new functions which would enable to develop forms and DB using new methods – automated database generation from forms and automatic forms association with database tables. OpenOffice.org Base DBMS and Java programming language has been chosen for the task implementation. This thesis consists of analysis, design, user manual, experimental and conclusion parts.
6
Wijesekera, Primal. "Scalable Database Management System (DBMS) architecture with Innesto." Thesis, University of British Columbia, 2012. http://hdl.handle.net/2429/43363.
Full textAbstract:
Database Management systems (DBMS) have been in the core of Information Systems
for decades and their importance is getting higher and higher with current
high growth in user demand and rising necessity to handle big data. With recent
emergence of new style of deployments in the cloud, decades old architectures
in DBMS have been greatly challenged due to their inability to scale beyond single
computing node and to handle big data. This new requirement has spawned
new directions along scaling data storage architectures. Most of the work surfaced
lacks the applicability across many domains as they were targeting only a specific
domain.
We present a novel scalable architecture which is implemented using a distributed
spatial partitioning tree (SPT). This new architecture replaces only the
storage layer of a conventional DBMS thus leaving its applicability across domains
intact and provides strict consistency and isolation. Indexing and locking are
two important components of a Relational Database Management System (DBMS)
which pose as potential bottleneck when scaling. Our new approach based on SPT
provides a novel scalable alternative for these components.
Our evaluations using the TPC-C workload show they are capable of scaling
beyond single computing node and support more concurrent users compared to a
single node conventional system. We believe our contributions to be an important
first step towards the goal of a scalable, cloud aware and full-featured DBMS as a
service.
7
Atila, Yavuz Vural. "Design and implementation of a multimedia DBMS sound management integration /." Thesis, Monterey, California : Naval Postgraduate School, 1990. http://handle.dtic.mil/100.2/ADA245774.
Full textAbstract:
Thesis (M.S. in Engineering Science)--Naval Postgraduate School, December 1990.<br>Thesis Advisor(s): Lum, Vincent Y. Second Reader: Hsiao, David. "December 1990." Description based on title screen as viewed on ... DTIC Descriptor(s): Data bases, data management, sound, systems engineering, interfaces, alphanumeric data, integration, user needs, media, microcomputers, records, storage, sun, computers, local area networks, management, environments, theses DTIC Identifier(s): Data bases, systems engineering, sound, data management, MDBMS (multimedia database management system), theses, man computer interface, catalogs, data storage systems Author(s) subject terms: Multimedia Database Management System, Multimedia, DBMS, MDBMS, Sound Media Management, Sound Database Includes bibliographical references (p. 62-64).62 Also available in print.
8
Beyers, Hector Quintus. "Database forensics : Investigating compromised database management systems." Diss., University of Pretoria, 2013. http://hdl.handle.net/2263/41016.
Full textAbstract:
The use of databases has become an integral part of modern human life. Often the data
contained within databases has substantial value to enterprises and individuals. As
databases become a greater part of people’s daily lives, it becomes increasingly interlinked with human behaviour. Negative aspects of this behaviour might include criminal activity,
negligence and malicious intent. In these scenarios a forensic investigation is required to collect evidence to determine what happened on a crime scene and who is responsible for the crime. A large amount of the research that is available focuses on digital forensics,
database security and databases in general but little research exists on database forensics as such. It is difficult for a forensic investigator to conduct an investigation on a DBMS due to limited information on the subject and an absence of a standard approach to follow during a forensic investigation. Investigators therefore have to reference disparate sources of information on the topic of database forensics in order to compile a self-invented approach to investigating a database. A subsequent effect of this lack of research is that compromised DBMSs (DBMSs that have been attacked and so behave abnormally) are not considered or understood in the database forensics field. The concept of compromised DBMSs was illustrated in an article by Olivier who suggested that the ANSI/SPARC model can be used to assist in a forensic investigation on a compromised DBMS. Based on the ANSI/SPARC model, the DBMS was divided into four layers known as the data model, data dictionary, application schema and application data. The extensional nature of the first three layers can influence the application data layer and ultimately manipulate the results produced on the application data layer. Thus, it becomes problematic to conduct a forensic investigation on a DBMS if the integrity of the extensional layers is in question and hence the results on the application data layer cannot be trusted. In order to recover the integrity of a layer of the DBMS a clean layer (newly installed layer) could be used but clean layers are not easy or always possible to configure on a DBMS depending on the forensic scenario. Therefore a combination of clean and existing layers can be used to do a forensic investigation on a DBMS.
PROBLEM STATEMENT
The problem to be addressed is how to construct the appropriate combination of clean and existing layers for a forensic investigation on a compromised DBMS, and ensure the
integrity of the forensic results.
APPROACH
The study divides the relational DBMS into four abstract layers, illustrates how the layers
can be prepared to be either in a found or clean forensic state, and experimentally
combines the prepared layers of the DBMS according to the forensic scenario. The study
commences with background on the subjects of databases, digital forensics and database forensics respectively to give the reader an overview of the literature that already exists in these relevant fields. The study then discusses the four abstract layers of the DBMS and explains how the layers could influence one another. The clean and found environments are introduced due to the fact that the DBMS is different to technologies where digital forensics has already been researched. The study then discusses each of the extensional abstract layers individually, and how and why an abstract layer can be converted to a clean or found state. A discussion of each extensional layer is required to understand how unique each layer of the DBMS is and how these layers could be combined in a way that enables a forensic investigator to conduct a forensic investigation on a compromised DBMS. It is illustrated that each layer is unique and could be corrupted in various ways. Therefore,
each layer must be studied individually in a forensic context before all four layers are
considered collectively. A forensic study is conducted on each abstract layer of the DBMS
that has the potential to influence other layers to deliver incorrect results. Ultimately, the
DBMS will be used as a forensic tool to extract evidence from its own encrypted data and
data structures. Therefore, the last chapter shall illustrate how a forensic investigator can
prepare a trustworthy forensic environment where a forensic investigation could be
conducted on an entire PostgreSQL DBMS by constructing a combination of the
appropriate forensic states of the abstract layers.
RESULTS
The result of this study yields an empirically demonstrated approach on how to deal with a compromised DBMS during a forensic investigation by making use of a combination of
various states of abstract layers in the DBMS. Approaches are suggested on how to deal
with a forensic query on the data model, data dictionary and application schema layer of
the DBMS. A forensic process is suggested on how to prepare the DBMS to extract
evidence from the DBMS. Another function of this study is that it advises forensic
investigators to consider alternative possibilities on how the DBMS could be attacked.
These alternatives might not have been considered during investigations on DBMSs to
date. Our methods have been tested at hand of a practical example and have delivered
promising results.<br>Dissertation (MEng)--University of Pretoria, 2013.<br>gm2014<br>Electrical, Electronic and Computer Engineering<br>unrestricted
9
Jäkel, Tobias. "Role-based Data Management." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-224416.
Full textAbstract:
Database systems build an integral component of today’s software systems and as such they are the central point for storing and sharing a software system’s data while ensuring global data consistency at the same time. Introducing the primitives of roles and their accompanied metatype distinction in modeling and programming languages, results in a novel paradigm of designing, extending, and programming modern software systems. In detail, roles as modeling concept enable a separation of concerns within an entity. Along with its rigid core, an entity may acquire various roles in different contexts during its lifetime and thus, adapts its behavior and structure dynamically during runtime.
Unfortunately, database systems, as important component and global consistency provider of such systems, do not keep pace with this trend. The absence of a metatype distinction, in terms of an entity’s separation of concerns, in the database system results in various problems for the software system in general, for the application developers, and finally for the database system itself. In case of relational database systems, these problems are concentrated under the term role-relational impedance mismatch. In particular, the whole software system is designed by using different semantics on various layers. In case of role-based software systems in combination with relational database systems this gap in semantics between applications and the database system increases dramatically. Consequently, the database system cannot directly represent the richer semantics of roles as well as the accompanied consistency constraints. These constraints have to be ensured by the applications and the database system loses its single point of truth characteristic in the software system. As the applications are in charge of guaranteeing global consistency, their development requires more effort in data management. Moreover, the software system’s data management is distributed over several layers, which results in an unstructured software system architecture.
To overcome the role-relational impedance mismatch and bring the database system back in its rightful position as single point of truth in a software system, this thesis introduces the novel and tripartite RSQL approach. It combines a novel database model that represents the metatype distinction as first class citizen in a database system, an adapted query language on the database model’s basis, and finally a proper result representation. Precisely, RSQL’s logical database model introduces Dynamic Data Types, to directly represent the separation of concerns within an entity type on the schema level. On the instance level, the database model defines the notion of a Dynamic Tuple that combines an entity with the notion of roles and thus, allows for dynamic structure adaptations during runtime without changing an entity’s overall type.
These definitions build the main data structures on which the database system operates. Moreover, formal operators connecting the query language statements with the database model data structures, complete the database model. The query language, as external database system interface, features an individual data definition, data manipulation, and data query language. Their statements directly represent the metatype distinction to address Dynamic Data Types and Dynamic Tuples, respectively. As a consequence of the novel data structures, the query processing of Dynamic Tuples is completely redesigned. As last piece for a complete database integration of a role-based notion and its accompanied metatype distinction, we specify the RSQL Result Net as result representation. It provides a novel result structure and features functionalities to navigate through query results. Finally, we evaluate all three RSQL components in comparison to a relational database system. This assessment clearly demonstrates the benefits of the roles concept’s full database integration.
10
Behzadnia, Peyman. "Dynamic Energy-Aware Database Storage and Operations." Scholar Commons, 2018. http://scholarcommons.usf.edu/etd/7125.
Full textAbstract:
Energy consumption has become a first-class optimization goal in design and implementation of data-intensive computing systems. This is particularly true in the design of database management systems (DBMS), which is one of the most important servers in software stack of modern data centers. Data storage system is one of the essential components of database and has been under many research efforts aiming at reducing its energy consumption. In previous work, dynamic power management (DPM) techniques that make real-time decisions to transition the disks to low-power modes are normally used to save energy in storage systems. In this research, we tackle the limitations of DPM proposals in previous contributions and design a dynamic energy-aware disk storage system in database servers. We introduce a DPM optimization model integrated with model predictive control (MPC) strategy to minimize power consumption of the disk-based storage system while satisfying given performance requirements. It dynamically determines the state of disks and plans for inter-disk data fragment migration to achieve desirable balance between power consumption and query response time. Furthermore, via analyzing our optimization model to identify structural properties of optimal solutions, a fast-solution heuristic DPM algorithm is proposed that can be integrated in large-scale disk storage systems, where finding the most optimal solution might be long, to achieve near-optimal power saving solution within short periods of computational time. The proposed ideas are evaluated through running simulations using extensive set of synthetic workloads. The results show that our solution achieves up to 1.65 times more energy saving while providing up to 1.67 times shorter response time compared to the best existing algorithm in literature.
Stream join is a dynamic and expensive database operation that performs join operation in real-time fashion on continuous data streams. Stream joins, also known as window joins, impose high computational time and potentially higher energy consumption compared to other database operations, and thus we also tackle energy-efficiency of stream join processing in this research. Given that there is a strong linear correlation between energy-efficiency and performance of in-memory parallel join algorithms in database servers, we study parallelization of stream join algorithms on multicore processors to achieve energy efficiency and high performance. Equi-join is the most frequent type of join in query workloads and symmetric hash join (SHJ) algorithm is the most effective algorithm to evaluate equi-joins in data streams. To best of our knowledge, we are the first to propose a shared-memory parallel symmetric hash join algorithm on multi-core CPUs. Furthermore, we introduce a novel parallel hash-based stream join algorithm called chunk-based pairing hash join that aims at elevating data throughput and scalability. We also tackle parallel processing of multi-way stream joins where there are more than two input data streams involved in the join operation. To best of our knowledge, we are also the first to propose an in-memory parallel multi-way hash-based stream join on multicore processors. Experimental evaluation on our proposed parallel algorithms demonstrates high throughput, significant scalability, and low latency while reducing the energy consumption. Our parallel symmetric hash join and chunk-based pairing hash join achieve up to 11 times and 12.5 times more throughput, respectively, compared to that of state-of-the-art parallel stream join algorithm. Also, these two algorithms provide up to around 22 times and 24.5 times more throughput, respectively, compared to that of non-parallel (sequential) stream join computation where there is one processing thread.
Books on the topic "Database management systems (DBMSs)"
1
Kuzin, Aleksandr. Basics of database design. INFRA-M Academic Publishing LLC., 2024. http://dx.doi.org/10.12737/1096072.
Full textAbstract:
The textbook discusses the basic issues of database design theory, the use of the Access database management system (DBMS) to create databases, the specifics of developing user applications based on the Microsoft Access DBMS, as well as the architecture of the database system. Meets the requirements of the federal state educational standards of secondary vocational education of the latest generation. For students of secondary specialized educational institutions studying in the field of "Information systems".
2
Martishin, Sergey, Vladimir Simonov, and Marina Hrapchenko. Databases: Design and development of information systems using MySQL DBMS and Go language. INFRA-M Academic Publishing LLC., 2023. http://dx.doi.org/10.12737/1830834.
Full textAbstract:
The tutorial is intended for studying and creating databases and information systems and applications using the MySQL database management system and the Go programming language. The book consistently introduces students to the installation and development of the MySQL Workbench workspace for working with MySQL DBMS; the basics of MySQL server administration; designing ER models in MySQL Workbench. The basics of the Go language are given. The creation of a project in the Go language is being considered. For the convenience of working with the textbook, program codes are placed in the cloud storage of the electronic library system of the publishing house "Znanium".
 Meets the requirements of the federal state educational standards of higher education of the latest generation and professional standards.
 For students, bachelors, undergraduates, postgraduates and specialists studying in the specialties and areas of training: "Computer Science and Computer Engineering", "Information systems and technologies", "Software Engineering", "Applied Mathematics and Computer Science", "Management in technical systems", "Business Informatics", "Pedagogical education", as well as for all persons engaged in the design of modern databases, information systems, the creation of mobile and Internet applications based on the MySQL database management system and the Go programming language.
3
Gagarina, Larisa, and Julia Sergeevna Shevnina. Development and operation of automated information systems. INFRA-M Academic Publishing LLC., 2025. https://doi.org/10.12737/1985727.
Full textAbstract:
The textbook provides the basic concepts and definitions of the design process of automated information systems (AIS) based on domain analysis; highlights the issues of developing the software and information core of AIS based on database management systems (DBMS). Computer-aided design systems (AIS), computer-aided design tools for database structures, the SQL structural query language, and standard database access systems are considered. Remote access clients are given as fundamental factors in the study of computer-aided database design and the construction of database queries is given; client software development; the main elements of client programs. The article also describes the features of AIS operation, methods and means of data collection and transmission; ensuring the reliability of information during its storage and processing; exporting database structures; restoring information in databases. Meets the requirements of the federal state educational standards of secondary vocational education of the latest generation. For students of secondary vocational educational institutions studying in the group of specialties "Computer Science and computer Engineering". It can be used for self-education in the field of information technology.
4
C, Calderon Sonia, Rousseau Peter L, and York Stanley A, eds. DBMS1, a mainframe database management system. 3rd ed. Iona College, 1986.
Find full text
5
Dorothy, Moore, ed. Object-relational DBMSs: The next great wave. Morgan Kaufmann Publishers, 1996.
Find full text
6
1968-, Brown Paul, and Moore Dorothy, eds. Object-relational DBMSs: Tracking the next great wave. 2nd ed. Morgan Kaufmann Publishers, 1999.
Find full text
7
Institute, SAS, ed. System 2000 DBMS messages and codes manual. SAS Institute, 1986.
Find full textBook chapters on the topic "Database management systems (DBMSs)"
1
Geisler, Sandra, and Christoph Quix. "Database Management Systems (DBMS)." In Encyclopedia of Big Data. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-319-32010-6_538.
Full text
2
Geisler, Sandra, and Christoph Quix. "Database Management Systems (DBMS)." In Encyclopedia of Big Data. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-319-32001-4_538-1.
Full text
3
Jasny, Matthias, Tobias Ziegler, and Carsten Binnig. "Scalable Data Management on Next-Generation Data Center Networks." In Scalable Data Management for Future Hardware. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-74097-8_8.
Full textAbstract:
Abstract The landscape of distributed Database Management Systems (DBMSs) has been fundamentally transformed by advancements in data center network technologies. Traditionally, these systems were designed to minimize network communication, which was perceived as a significant bottleneck. However, with the advent of high-speed networks and technologies such as Remote Direct Memory Access (RDMA), this perception is changing. RDMA allows direct memory access to remote machines at speeds comparable to local memory access, challenging the long-standing belief that network communication is inherently slow. This chapter explores how the evolution of data center networks, mainly through RDMA, has enabled new designs for disaggregated databases. Moreover, the chapter delves into programmable networks as a solution beyond RDMA. In particular, this chapter provides an overview of RDMA and programmable networks and introduces novel ideas for optimizing databases in disaggregated setups using RDMA. Furthermore, two approaches are highlighted that leverage programmable networks in addition to RDMA to improve the efficiency of disaggregated databases even further: P4DB, which leverages programmable data planes for in-network OLTP processing, and zero-sided RDMA, a network-driven data shuffling method that enhances communication efficiency between heterogeneous accelerators. By showcasing these advancements, we demonstrate how database systems can utilize specialized networking hardware to achieve unprecedented performance levels. The chapter concludes with a summary and discussion of future research directions in the field of data center network technologies and their impact on distributed DBMSs.
4
Raper, Jonathan F., and Michael S. Bundock. "Implementation of a User Environment for a Spatial DBMS." In Geographic Database Management Systems. Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-77605-2_3.
Full text
5
Kacprzyk, Janusz, and Sławomir Zadrożny. "Fquery for Access: Fuzzy Querying for a Windows-Based DBMS." In Fuzziness in Database Management Systems. Physica-Verlag HD, 1995. http://dx.doi.org/10.1007/978-3-7908-1897-0_18.
Full text
6
Chung, IlYoung, JeHyok Ryu, and Chong Sun Hwang. "Efficient Cache Management Protocol Based on Data Locality in Mobile DBMSs." In Current Issues in Databases and Information Systems. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44472-6_5.
Full text
7
Grandison, Tyrone. "Privacy-Preserving DBMSs." In Encyclopedia of Database Systems. Springer New York, 2017. http://dx.doi.org/10.1007/978-1-4899-7993-3_80753-1.
Full text
8
Grandison, Tyrone. "Privacy-Preserving DBMSs." In Encyclopedia of Database Systems. Springer New York, 2018. http://dx.doi.org/10.1007/978-1-4614-8265-9_80753.
Full text
9
Hahn, Tobias, Maximilian Langohr, Andreas Becher, et al. "ReProVide: Query Optimization and Near-Data Processing on Reconfigurable SoCs for Big Data Analysis." In Scalable Data Management for Future Hardware. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-74097-8_7.
Full textAbstract:
Abstract The available parallelism and heterogeneity of emerging computer systems must be exploited for being able to process the huge amounts of data produced every day. As a consequence, we observe an increasing research interest in accelerating database query processing on multi-cores and attached co-processors like Graphics Processing Units (GPUs) and Field-Programmable Gate Arrays (FPGAs). This chapter presents ReProVide, an approach combining near-data processing and FPGA-based acceleration. The System-on-Chip (SoC) architecture of ReProVide including a flexibly reconfigurable FPGA can load and execute hardware accelerators for various operators on relational and streaming data. Moreover, we present novel DBMS techniques for partitioning query-execution plans between a host and Reconfigurable data-Provider Units (RPUs) and for mapping operators onto RPUs by means of hardware reconfiguration.
10
Patni, Jagdish Chandra, Hitesh Kumar Sharma, Ravi Tomar, and Avita Katal. "Data Models and Architecture of a DBMS." In Database Management System. Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9780429282843-2.
Full textConference papers on the topic "Database management systems (DBMSs)"
1
Dinev, Diyan, and Gergana Spasova. "PHP based Database Management Tool." In 2024 5th International Conference on Communications, Information, Electronic and Energy Systems (CIEES). IEEE, 2024. https://doi.org/10.1109/ciees62939.2024.10811406.
Full text
2
Kleptsov, M. Y., M. A. Vasilyeva, and M. V. Katina. "ADMINISTRATION AND ENSURING THE INTEGRITY OF DATABASES RUNNING UNDER THE POSTGRESQL DATABASE MANAGEMENT SYSTEM." In Intelligent transport systems. Russian University of Transport, 2024. http://dx.doi.org/10.30932/9785002446094-2024-154-160.
Full textAbstract:
Computer systems use databases for correct operating. Relational databases have become widespread. There are several leaders in relational DBMSs in the world. Among them is the PostgreSQL DBMS, which is a freely distributed product. A crucial aspect of database administration throughout all stages (design, development, implementation, and maintenance) is the need to give due consideration to security matters and the application of appropriate database access controls. This issue is relevant due to the increasing number of users within the organization's global networks who have direct access to company resources and data, a significant increase for information transmitted, stored, and processed in computer systems, and an increasing need for protection and integrity of this information in relation to the DBMS PostgreSQL.
3
Lustosa, Hermano, Fábio Porto, and Patrick Valduriez. "SAVIME: A Database Management System for Simulation Data Analysis and Visualization." In XXXIV Simpósio Brasileiro de Banco de Dados. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/sbbd.2019.8810.
Full textAbstract:
Limitations in current DBMSs prevent their wide adoption in scientific applications. In order to make scientific applications benefit from DBMS support, enabling declarative data analysis and visualization over scientific data, we present an in-memory array DBMS system called SAVIME. In this work we describe the system SAVIME, along with its data model. Our preliminary evaluation shows how SAVIME, by using a simple storage definition language (SDL) can outperform the state-of-the-art array database system, SciDB, during the process of data ingestion. We also show that is possible to use SAVIME as a storage alternative for a numerical solver without affecting its scalability.
4
Gomes, Carlos, Eduardo Tavares, and Meuse Nogueira De O. Junior. "Energy Consumption Evaluation of NoSQL DBMSs." In XV Workshop em Desempenho de Sistemas Computacionais e de Comunicação. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/wperformance.2016.9729.
Full textAbstract:
Over the years, NoSQL Database Management Systems (DBMS) have been adopted as an alternative to the constraints of relational/SQL DBMSs. In order to demonstrate their feasibility, works have evaluated NoSQL DBMSs regarding some performance metrics, but energy consumption has not been assessed. Indeed, energy consumption is an issue that should not be neglected due to the rise of energy costs and environmental sustainability. This paper presents a peformance and energy consumption evaluation of NoSQL DBMSs, more specifically, Cassandra (column), MongoDB (document-oriented), Redis (key-value). Experiments are based on YCSB benchmark, and results demonstrate energy consumption can vary significantly among the assessed DBMSs for different commands (e.g., read) and workloads.
5
Berra, P. Bruce. "Optical Database Machines." In Optical Computing. Optica Publishing Group, 1991. http://dx.doi.org/10.1364/optcomp.1991.tuc1.
Full textAbstract:
Databases have become an important aspect of our daily lives. We encounter them in such diverse fields as airline reservations, stock quotation systems, medical information systems, entertainment, sports and a host of other areas. Database management systems (DBMS) place considerable demands on current computing systems primarily because of the large size of the databases, the general functionality of the DBMS and the stringent time requirements for the retrieval of the data. The large size of the database dictates that secondary storage such as optical and magnetic disks be used and this leads to input/output data accessing difficulties since these memory types are on the order of one million times slower in access time than main memory technology. The diverse functionality of DBMS leads to systems with millions of lines of code that consume an enormous number of machine cycles. Add to this the near real time requirement for many applications and one has a system that is both I/O and compute bound.
6
Zhang, W. J., Q. Li, and S. K. Tso. "A Comprehensive Study of Instance-As-Type Phenomenon in Product Date Modelling." In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/eim-9017.
Full textAbstract:
Abstract This paper presents a comprehensive discussion of the Instance-As-Type (IAT) phenomenon that is observed in the development of complex engineering/product design databases. Basically, IAT reflects a kind of data dependency in databases; in particular it means that a data object appears both in the form of a type and in the form of an instance. As it is well known, uncontrolled data dependencies may lead to information inconsistency and thus severely affect the effectiveness of the product development process. It is therefore very important to develop strategies to cope with IAT in the design of complex engineering databases. The contributions of this paper lie in several aspects. It has provided a more comprehensive description of IAT, including an argument that IAT is in fact not a kind of data redundancy but data dependency. It has also clarified the two and only two feasible strategies for dealing with IAT, i.e., one making IAT absent in a database (strategy 1) and the other preserving IAT by providing a means to control it (strategy 2). The advantages and disadvantages associated with these two strategies have been discussed. Finally, this paper has pointed out that the implementation of strategy 2 can be realized by using general-purpose database management systems (DBMSs) by developing an enhanced program module. A general way to implement this module has also been outlined.
7
Petrova, A. "THE METHODOLOGY OF DBMS PERFORMANCE RESEARCH ON MOBILE DEVICES." In CHALLENGING ISSUES IN SYSTEMS MODELING AND PROCESSES. FSBE Institution of Higher Education Voronezh State University of Forestry and Technologies named after G.F. Morozov, 2025. https://doi.org/10.58168/cismp2024_686-688.
Full text
8
Kvyetnyy, Roman, Oleksandr Kyrylenko, and Volodymyr Garmash. "RESEARCH ON THE USE OF POSTGRESQL IN A HUMAN RE-IDENTIFICATION INFORMATION SYSTEM." In 17th IC Measurement and Control in Complex Systems. VNTU, 2024. https://doi.org/10.31649/mccs2024.2-15.
Full textAbstract:
This paper investigates the application of the PostgreSQL database management system in the context of human re-identification systems based on computer vision technologies. Considering the growing need for efficient storage and processing of large-scale vector data obtained through deep neural networks, the issue of optimizing databases for fast and accurate matching of individuals' vector features arises. The study examines the specifics of storing high-dimensional vector representations in PostgreSQL using the pgvector extension, which provides efficient similarity search capabilities using metrics like cosine similarity and Euclidean distance. A detailed experimental analysis of PostgreSQL's performance was conducted during the execution of nearest neighbor search operations (k-NN search) based on vector features obtained from the open dataset Market-1501. The speed and accuracy of PostgreSQL were compared with other popular DBMSs such as MySQL and MongoDB, utilizing similar data storage and indexing methods. The research results demonstrate that PostgreSQL with the pgvector extension provides significantly better performance, achieving an average query execution time of 35 ms and a throughput of 285 queries per second, surpassing the metrics of MySQL and MongoDB. Moreover, the use of PostgreSQL contributes to increased accuracy in re-identification, as confirmed by higher mAP (mean Average Precision) values (78% compared to 72% in MySQL and 70% in MongoDB). Factors influencing system performance are discussed, including indexing efficiency, query optimization, and system resource utilization. The paper also explores the scalability of PostgreSQL for processing even larger volumes of data and its integration with other tools to enhance performance. The obtained results confirm the feasibility of using PostgreSQL in human re-identification systems, which can have practical significance for developing high-performance and scalable security and monitoring systems. Future research may focus on optimizing search algorithms and integrating advanced machine learning technologies to further improve system accuracy and speed
9
Kunitsyn, V., and E. Ilyin. "AUTOMATION SYSTEMS FOR DESIGNING DIRECTED GRAPHS IN RELATIONAL DATABASES." In CHALLENGING ISSUES IN SYSTEMS MODELING AND PROCESSES. FSBE Institution of Higher Education Voronezh State University of Forestry and Technologies named after G.F. Morozov, 2025. https://doi.org/10.58168/cismp2024_338-342.
Full textAbstract:
In recent years, directed graphs have become an important tool for modeling complex relationships in relational databases. This paper examines the concept of directed graphs, their structure, and their application in the context of relational database management systems (DBMS). Directed graphs, consisting of vertices and directed edges, allow for the efficient representation and analysis of relationships between entities, such as dependencies, connections, and hierarchies. The article discusses methods for implementing graph structures in relational databases, including the use of tables to represent vertices and edges, as well as recursive queries to perform complex operations. The advantages and disadvantages of using directed graphs are considered, such as flexibility in modeling and potential performance issues. The work emphasizes the significance of graph structures in modern data management systems and their role in optimizing processes for data analysis and processing.
10
Hirano, Takato, Yutaka Kawai, and Yoshihiro Koseki. "DBMS-Friendly Searchable Symmetric Encryption: Constructing Index Generation Suitable for Database Management Systems." In 2021 IEEE Conference on Dependable and Secure Computing (DSC). IEEE, 2021. http://dx.doi.org/10.1109/dsc49826.2021.9346255.
Full textReports on the topic "Database management systems (DBMSs)"
1
Lum, Vincent Y., and Klaus Meyer-Wegener. A Conceptual Design of a Multimedia DBMS (Database Management System) for Advanced Applications. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada199548.
Full text
2
Dabrowski, Christopher E., Elizabeth N. Fong, and Deyuan Yang. Object database management systems. National Institute of Standards and Technology, 1990. http://dx.doi.org/10.6028/nist.sp.500-179.
Full text
3
Dabrowski, Christopher, and Elizabeth Fong. Database Management Systems in engineering. National Institute of Standards and Technology, 1992. http://dx.doi.org/10.6028/nist.ir.4987.
Full text
4
Prakash, Ishita. A platform for benchmarking Database Management Systems: CyDIW. Iowa State University, 2019. http://dx.doi.org/10.31274/cc-20240624-57.
Full text
5
Mears, Brad. Advanced Traffic Management Systems (ATMS) Research Analysis Database System. Defense Technical Information Center, 2001. http://dx.doi.org/10.21236/ada388177.
Full text
6
Wolery, T., and M. Sutton. Generic Natural Systems Evaluation - Thermodynamic Database Development and Data Management. Office of Scientific and Technical Information (OSTI), 2011. http://dx.doi.org/10.2172/1035958.
Full text
7
De Paula, Everton G., and Michael L. Nelson. Clustering, Concurrency Control, Crash Recovery, Garbage Collection, and Security in Object-Oriented Database Management Systems. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada235448.
Full text
8
Sumbukeni, H. Operating and maintenance of computerized geosciences database management systems in some of Zambia's mineral exploration and mining sectors. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 1994. http://dx.doi.org/10.4095/193887.
Full text
9
Anderson, Barry. The OECD/World Bank Budget Database: The Current Database and Plans for the Future. Inter-American Development Bank, 2005. http://dx.doi.org/10.18235/0006766.
Full textAbstract:
This presentation discusses the contents of the current OECD/World Bank Database which consists of the following parts: 1) General Information; 2) Formulation;3) Budget Execution; 4) Accounting, Control & Monitoring Systems; 5) Budget Documentation & Performance Management; 6) Fiscal Relations Among Levels of Government; 7) Special Relationships/Issues. Also discussed are changes planned for the update of the database and next steps. This document was presented by the Public Management and Transparency Network of the Regional Policy Dialogue for the 6th Hemispheric Meeting held on May 23rd and 24th, 2005.
10
Pokryshen, Dmytro A., Evgeniy H. Prokofiev, and Albert A. Azaryan. Blogger and YouTube services at a distant course “Database management system Microsoft Access”. [б. в.], 2019. http://dx.doi.org/10.31812/123456789/3272.
Full textAbstract:
The article is devoted to the coverage of the course “Database management system Microsoft Access”, an educational blog review “The development of a creative child. ІCТ”, which is used as an auxiliary tool for promoting a course and teacher in the Internet, structural analysis of this blog is made. The channel location is set on YouTube video hosting and how it is used in the course on databases. Attention is drawn to the fact that theoretical and practical material is considered on real, implemented informational and analytical systems. To prepare students for the Olympiads and provide methodological help teachers of computer science are looking at tasks from databases that were offered at the All-Ukrainian Olympiads on Information Technologies, especially II, III and IV stages (offline and online Olympiads), which are located in open access to the blog and YouTube channel. The main focus of the article is devoted to the practical side of teaching teachers of computer science, experience in using the above technologies.