Relevant bibliographies by topics / Database theory / Journal articles
To see the other types of publications on this topic, follow the link: Database theory.

Journal articles on the topic 'Database theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 15 June 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Database theory.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Ullman, Jeff. "Moving database theory into database practice." ACM Computing Surveys 28, no. 4es (December 1996): 90. http://dx.doi.org/10.1145/242224.242343.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tan, Wang-Chiew. "Database Theory Column." ACM SIGACT News 47, no. 3 (August 31, 2016): 67–68. http://dx.doi.org/10.1145/2993749.2993762.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Paredaens, Jan. "Database theory column." ACM SIGACT News 29, no. 3 (September 1998): 23–26. http://dx.doi.org/10.1145/300307.300309.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Su, Jianwen. "Database theory column." ACM SIGACT News 40, no. 4 (January 25, 2010): 62–63. http://dx.doi.org/10.1145/1711475.1711488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lenzerini, Maurizio. "Database theory column." ACM SIGACT News 39, no. 3 (September 2008): 63–65. http://dx.doi.org/10.1145/1412700.1412715.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tao, Yufei. "Database Theory Column." ACM SIGACT News 51, no. 3 (September 29, 2020): 59–61. http://dx.doi.org/10.1145/3427361.3427372.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Van den Bussche, Jan. "Database theory column." ACM SIGACT News 37, no. 4 (December 2006): 56–57. http://dx.doi.org/10.1145/1189056.1189072.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Benedikt, Michael. "Database Theory 2004." Journal of Computer and System Sciences 73, no. 3 (May 2007): 243–44. http://dx.doi.org/10.1016/j.jcss.2006.10.023.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Abiteboul, Serge, and Paris Kanellakis. "Database theory column." ACM SIGACT News 21, no. 3 (August 1990): 9–18. http://dx.doi.org/10.1145/101368.101370.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kanellakis, P., and S. Abiteboul. "Database theory column." ACM SIGACT News 20, no. 4 (November 1989): 17–23. http://dx.doi.org/10.1145/74074.74077.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Vianu, Victor. "Database theory column." ACM SIGACT News 39, no. 1 (March 2008): 77–79. http://dx.doi.org/10.1145/1360443.1360460.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Ngo, Hung Q. "Database Theory Column." ACM SIGACT News 54, no. 3 (September 7, 2023): 42–45. http://dx.doi.org/10.1145/3623800.3623806.

Full text
Abstract:
The 42nd edition of the ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS) was held from June 19 to June 21, 2023, in Seattle, USA. After two years of online-only and a year of hybrid conferences, PODS 2023 went back to a fully in-person conference format. As is customary, the symposium was held jointly with the ACM International Conference on Management of Data (SIGMOD).
APA, Harvard, Vancouver, ISO, and other styles
13

Snehal Eknath Phule. "Graph Theory Applications in Database Management." International Journal of Scientific Research in Modern Science and Technology 3, no. 3 (March 16, 2024): 13–17. http://dx.doi.org/10.59828/ijsrmst.v3i3.190.

Full text
Abstract:
Graph theory, which is a branch of discrete mathematics, has emerged as a powerful tool in various domains, including database management. This abstract investigates the ways in which ideas and methods from graph theory which can be applied to database systems, offering a thorough synopsis of their benefits. Complex interactions within data can be well-modeled by using the basic concepts of graph theory, such as nodes, edges, and relationships. Because of its capacity to represent and query complex relationships, graph databases have become more and more popular in the field of database administration. Graph databases are well-suited for situations such as social networks, recommendation systems, and interconnected data domains because they are excellent at representing and traversing relationships, in contrast to standard relational databases, which are excellent at managing structured data. The abstract delves into the key graph-based data models, such as property graphs, RDF (Resource Description Framework), explaining how they facilitate the representation of diverse relationships. Furthermore, it explores the efficient storage and retrieval mechanisms that leverage graph traversal algorithms to extract valuable insights from interconnected datasets. The document highlights specific use cases where graph theory contributes to database management, including fraud detection, social network analysis, and recommendation systems. Additionally, it discusses the challenges associated with integrating graph databases into existing infrastructures and proposes solutions to address scalability and performance concerns. The abstract also touches upon the advancements in graph database query languages (Cypher) and SPARQL, showcasing their expressive power in querying complex relationships. The inclusion of graph-based indexing and optimization techniques demonstrates how database systems can efficiently handle queries involving large-scale graph data. As graph databases continue to evolve, this abstract concludes by outlining potential future directions in the intersection of graph theory and database management. It emphasizes the importance of ongoing research in developing scalable and efficient solutions for managing interconnected data, ultimately paving the way for more sophisticated and context-aware database systems relationships. Furthermore, it explores the efficient storage and retrieval mechanisms that leverage graph traversal algorithms to extract valuable insights from interconnected datasets.
APA, Harvard, Vancouver, ISO, and other styles
14

Yannakakis, Mihalis. "Perspectives on database theory." ACM SIGACT News 27, no. 3 (September 1996): 25–49. http://dx.doi.org/10.1145/235666.235670.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Dietrich, Suzanne W., and Susan D. Urban. "Database theory in practice." ACM SIGCSE Bulletin 28, no. 1 (March 1996): 112–16. http://dx.doi.org/10.1145/236462.236520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Ullmann, JR. "Database theory and practice." Information and Software Technology 30, no. 10 (December 1988): 617. http://dx.doi.org/10.1016/0950-5849(88)90119-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

Vidyasankar, K. "Unified Theory of Database Serializability12." Fundamenta Informaticae 14, no. 2 (February 1, 1991): 147–83. http://dx.doi.org/10.3233/fi-1991-14202.

Full text
Abstract:
A database system is a collection of data items, read or written by transactions in a possibly interleaved fashion. An interleaved execution is assumed to be correct if the sequence of the steps of the transactions, called history, is serializable, that is, the effect of the execution is equivalent to that of some serial execution of the same transactions. In this paper we give a new characterization of serializability that brings out the inherent problem of serialization explicitly. We then give a graph-theoretic analogue of serializable histories. We define a new class of graphs, called serializable graphs, whose properties are such that (i) a serializable graph can be associated with each serializable history, and this can be done for various notions of serializability of histories and for serializability under various sets of constraints, and (ii) a serializable history, in fact a serial one, can be associated with each serializable graph. We use serializable graphs to characterize, in an intuitive manner, serializable histories involving general multi-step transactions, where the same data item can be accessed by several read and write steps of a transaction in an arbitrary manner, and those involving nested transactions. We also define a new notion of serializability for nested transactions. This enables relating several acceptable concurrent executions of transactions, that are not serializable with the traditional transaction concept, to sequential behaviour. Serializability under this notion is also characterized. The main graph-theoretic properties used in these characterizations are a directed cutset matching property and graph contraction.
APA, Harvard, Vancouver, ISO, and other styles
18

Suciu, Dan. "Special issue on database theory." Journal of Computer and System Sciences 73, no. 4 (June 2007): 537. http://dx.doi.org/10.1016/j.jcss.2006.10.025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Suciu, Dan. "On database theory and XML." ACM SIGMOD Record 30, no. 3 (September 2001): 39–45. http://dx.doi.org/10.1145/603867.603874.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Mancini, Vasco, and Wyllis Bandler. "A database theory of truth." Fuzzy Sets and Systems 25, no. 3 (March 1988): 369–79. http://dx.doi.org/10.1016/0165-0114(88)90021-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Stepanenko, A. A., and V. I. Martyanov. "Design of databases in road industry using set-theory analysis of complex systems." Journal «Izvestiya vuzov. Investitsiyi. Stroyitelstvo. Nedvizhimost» 12, no. 2 (2022): 214–23. http://dx.doi.org/10.21285/2227-2917-2022-2-214-223.

Full text
Abstract:
In the article, a method for designing databases for the road industry that meets the requirements of the digital economy was developed. The set-theory analysis of complex systems implemented by relational databases (RDBs) was used. This approach meets current trends in the global digital economy, where relational databases provide efficient operation of the banking sector, industrial production management, fast data processing (bank cards, Internet search), etc. The Department of Roads at Irkutsk National Research Technical University designed and is developing the road database for the Irkutsk region. The paper considers the concept of this project and prospects of its further development with a view to the possible use of this database by remote users. The specifics of digital economy in the Russian Federation call for establishing branches and territorial databases, including the road database for the Russian regions. The efficient solutions for such a database were proposed, including, in particular, integrating remote users with the back-end database based on the attribute characteristics to limit the available content and allowable changes to the back-end data.
APA, Harvard, Vancouver, ISO, and other styles
22

Kovtun, N. N. "Soft Power «real» science: Russian game theory in practice and in theory." Russian Journal of Legal Studies 3, no. 2 (June 15, 2016): 28–35. http://dx.doi.org/10.17816/rjls18125.

Full text
Abstract:
The work undertaken by a critical analysis of the main criteria for assessing the development of the Russian academic science through priority adoption and acceptance to the account only those publications that are reflected in the «universally recognized» scientometric databases WEB of Science database, SKORPUS, RSCI; the author points out a dead-end data vector «reforms» for Russian science, and for specific research.
APA, Harvard, Vancouver, ISO, and other styles
23

Majkić, Zoran, and Bhanu Prasad. "Theory of sketches for database mappings." International Journal of Intelligent Information and Database Systems 9, no. 1 (2015): 32. http://dx.doi.org/10.1504/ijiids.2015.070807.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

ten Cate, Balder, and Wang-Chiew Tan. "Foreword: Special Issue on Database Theory." Theory of Computing Systems 57, no. 4 (June 21, 2015): 1112–13. http://dx.doi.org/10.1007/s00224-015-9641-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Arenas, Marcelo. "Foreword: Special Issue on Database Theory." Theory of Computing Systems 61, no. 1 (May 9, 2017): 1. http://dx.doi.org/10.1007/s00224-017-9766-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Martens, Wim. "Foreword: Special Issue on Database Theory." Theory of Computing Systems 62, no. 4 (January 10, 2018): 771. http://dx.doi.org/10.1007/s00224-017-9835-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Stemple, D. W., T. E. Sheard, and R. E. Bunker. "Incorporating theory into database system development." Information Processing & Management 22, no. 4 (January 1986): 317–30. http://dx.doi.org/10.1016/0306-4573(86)90030-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Xiao, Hong Yu, Peng Zhou, and Chi Long Zhao. "The Breakthrough of Database Design Normalization Theory." Advanced Materials Research 204-210 (February 2011): 1615–18. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.1615.

Full text
Abstract:
This paper discusses four-atomization theories to database design, which are property atomization, Entity atomization, the primary key atomization, Relationship atomization, and explains why these theories are great development of normalization theory to database design.
APA, Harvard, Vancouver, ISO, and other styles
29

Pichler, Reinhard. "Database Theory Column Report on PODS 2021." ACM SIGACT News 52, no. 3 (October 17, 2021): 69–72. http://dx.doi.org/10.1145/3494656.3494669.

Full text
Abstract:
The 40th edition of the ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS) was held from June 20 to June 25, 2021, in Xi'an, Shaanxi, China. Due to the COVID-19 pandemic, it was organized in hybrid mode, with a local event primarily targeting the Chinese data management community and as a virtual (on- line) conference for the international community. As in previous years, the symposium was held jointly with the ACM International Conference on Management of Data (SIGMOD). PODS focuses on theoretical aspects of data management systems, and the co-location with SIGMOD stimulates interaction between theory-oriented and system-oriented research.
APA, Harvard, Vancouver, ISO, and other styles
30

Geerts, Floris. "Database Theory Column Report on PODS 2017." ACM SIGACT News 48, no. 4 (December 13, 2017): 75–77. http://dx.doi.org/10.1145/3173127.3173139.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Van Gucht, Dirk. "Database theory column report on Pods 2010." ACM SIGACT News 41, no. 3 (September 3, 2010): 86–87. http://dx.doi.org/10.1145/1855118.1855134.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Hadzilacos, Vassos. "A theory of reliability in database systems." Journal of the ACM 35, no. 1 (January 1988): 121–45. http://dx.doi.org/10.1145/42267.42272.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

宋, 伟伟. "Discussion on Teaching of “Spatial Database Theory”." Geomatics Science and Technology 03, no. 01 (2015): 1–5. http://dx.doi.org/10.12677/gst.2015.31001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Demetrovics, János, Gyula O. H. Katona, and Attila Sali. "Design type problems motivated by database theory." Journal of Statistical Planning and Inference 72, no. 1-2 (September 1998): 149–64. http://dx.doi.org/10.1016/s0378-3758(98)00029-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Arenas, Marcelo. "Guest editorial: Special issue on database theory." Journal of Computer and System Sciences 77, no. 3 (May 2011): 449. http://dx.doi.org/10.1016/j.jcss.2010.04.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Yan, Chao, Bo Li, Yevgeniy Vorobeychik, Aron Laszka, Daniel Fabbri, and Bradley Malin. "Database Audit Workload Prioritization via Game Theory." ACM Transactions on Privacy and Security 22, no. 3 (July 19, 2019): 1–21. http://dx.doi.org/10.1145/3323924.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Koch, Christoph. "Database Theory Column Report on PODS 2019." ACM SIGACT News 50, no. 4 (December 4, 2019): 93–94. http://dx.doi.org/10.1145/3374857.3374872.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Arenas, Marcelo. "Database Theory Column Report on PODS 2018." ACM SIGACT News 49, no. 4 (December 15, 2018): 55–57. http://dx.doi.org/10.1145/3300150.3300162.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Grohe, Martin. "Database Theory Column Report on PODS 2014." ACM SIGACT News 45, no. 4 (December 9, 2014): 83–85. http://dx.doi.org/10.1145/2696081.2696097.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Benedikt, Michael. "Guest Editorial: Special Issue on Database Theory." Theory of Computing Systems 63, no. 7 (June 17, 2019): 1572. http://dx.doi.org/10.1007/s00224-019-09933-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Ha, Van Muon, Yulia A. Shichkina, and Sergey V. Kostichev. "Determining the Composition of Collections for Key-Document Databases Based on a Given Set of Object Properties and Database Querie." Computer tools in education, no. 3 (September 30, 2019): 15–28. http://dx.doi.org/10.32603/2071-2340-2019-3-15-28.

Full text
Abstract:
The work of transforming a database from one format periodically appears in different organizations for various reasons. Today, the mechanism for changing the format of relational databases is well developed. However, with the advent of new types of databases, such as NoSQL, this problem is prevalent due to the radically different ways of data organization at the various databases. This article discusses a formalized method based on set theory, at the choice of the number and composition of collections for a key-value type database. The initial data are the properties of objects, about which information is stored in the database, and the set of queries that are most frequently executed. The considered method can be applied not only when creating a new keyvalue database, but also when transforming an existing one, when moving from relational databases to NoSQL, when consolidating databases.
APA, Harvard, Vancouver, ISO, and other styles
42

Arieli, O., M. Denecker, B. Van Nuffelen, and M. Bruynooghe. "Coherent Integration of Databases by Abductive Logic Programming." Journal of Artificial Intelligence Research 21 (March 1, 2004): 245–86. http://dx.doi.org/10.1613/jair.1322.

Full text
Abstract:
Abstract: We introduce an abductive method for a coherent integration of independent data-sources. The idea is to compute a list of data-facts that should be inserted to the amalgamated database or retracted from it in order to restore its consistency. This method is implemented by an abductive solver, called Asystem, that applies SLDNFA-resolution on a meta-theory that relates different, possibly contradicting, input databases. We also give a pure model-theoretic analysis of the possible ways to `recover' consistent data from an inconsistent database in terms of those models of the database that exhibit as minimal inconsistent information as reasonably possible. This allows us to characterize the `recovered databases' in terms of the `preferred' (i.e., most consistent) models of the theory. The outcome is an abductive-based application that is sound and complete with respect to a corresponding model-based, preferential semantics, and -- to the best of our knowledge -- is more expressive (thus more general) than any other implementation of coherent integration of databases.
APA, Harvard, Vancouver, ISO, and other styles
43

Blum, Avrim, Katrina Ligett, and Aaron Roth. "A learning theory approach to noninteractive database privacy." Journal of the ACM 60, no. 2 (April 2013): 1–25. http://dx.doi.org/10.1145/2450142.2450148.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

de Mauny, C. "High Court applies 'emission theory' to database infringement." Journal of Intellectual Property Law & Practice 6, no. 5 (April 14, 2011): 296–98. http://dx.doi.org/10.1093/jiplp/jpr006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Red'ko, V. N., and D. B. Bui. "Foundations of the theory of relational database models." Cybernetics and Systems Analysis 32, no. 4 (July 1996): 471–78. http://dx.doi.org/10.1007/bf02366768.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Dudakov, S. M., and M. A. Taitslin. "Collapse results for query languages in database theory." Russian Mathematical Surveys 61, no. 2 (April 30, 2006): 195–253. http://dx.doi.org/10.1070/rm2006v061n02abeh004311.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Voigt, Vilmos. "The Theory of Database in Folk Narrative Studies." Fabula 47, no. 3-4 (September 2006): 308–18. http://dx.doi.org/10.1515/fabl.2006.032.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Aranda-López, Gabriel, Susana Nieva, Fernando Sáenz-Pérez, and Jaime Sánchez-Hernández. "An extended constraint deductive database: Theory and implementation." Journal of Logic and Algebraic Programming 83, no. 1 (January 2014): 20–52. http://dx.doi.org/10.1016/j.jlap.2013.07.002.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Grant, John, and Jack Minker. "Deductive database theories." Knowledge Engineering Review 4, no. 4 (December 1989): 267–304. http://dx.doi.org/10.1017/s0269888900005129.

Full text
Abstract:
AbstractThis paper surveys a variety of deductive database theories. Such theories differ from one another in the set of axioms and metarules that they allow and use. The following theories are discussed: relational, Horn, and stratified in the text; protected, disjunctive, typed, extended Horn, and normal in the appendix. Connections with programming in terms of the declarative, fixpoint, and procedural semantics are explained. Negation is treated in several different ways: closed world, completed database, and negation as failure. For each theory examples are given and implementation issues are considered.
APA, Harvard, Vancouver, ISO, and other styles
50

Malykh, Mikhail D., Anton L. Sevastianov, and Leonid A. Sevastianov. "About Symbolic Integration in the Course of Mathematical Analysis." Computer tools in education, no. 4 (December 28, 2019): 94–106. http://dx.doi.org/10.32603/2071-2340-2019-4-94-106.

Full text
Abstract:
The work of transforming a database from one format periodically appears in different organizations for various reasons. Today, the mechanism for changing the format of relational databases is well developed. But with the advent of new types of database such as NoSQL, this problem was exacerbated due to the radical difference in the way data was organized. This article discusses a formalized method based on set theory, at the choice of the number and composition of collections for a key-value type database. The initial data are the properties of the objects, information about which is stored in the database, and the set of queries that are most frequently executed or the speed of which should be maximized. The considered method can be applied not only when creating a new key-value database, but also when transforming an existing one, when moving from relational databases to NoSQL, when consolidating databases.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Database theory' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography