Relevant bibliographies by topics / Database theory

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Database theory"

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
More sources

Dissertations / Theses on the topic "Database theory"

1

Butz, C. J. "The relational database theory of Bayesian networks." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0016/NQ54667.pdf.

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

Butz, C. J. "The relational database theory of Bayesian networks." Ottawa : National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.nlc-bnc.ca/obj/s4/f2/dsk1/tape3/PQDD%5F0016/NQ54667.pdf.

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

Krehbiel, Sara. "Strategic behavior and database privacy." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53964.

Full text
Abstract:
This dissertation focuses on strategic behavior and database privacy. First, we look at strategic behavior as a tool for distributed computation. We blend the perspectives of game theory and mechanism design in proposals for distributed solutions to the classical set cover optimization problem. We endow agents with natural individual incentives, and we show that centrally broadcasting non-binding advice effectively guides the system to a near-optimal state while keeping the original incentive structure intact. We next turn to the database privacy setting, in which an analyst wishes to learn something from a database, but the individuals contributing the data want to protect their personal information. The notion of differential privacy allows us to do both by obscuring true answers to statistical queries with a small amount of noise. The ability to conduct a task differentially privately depends on whether the amount of noise required for privacy still permits statistical accuracy. We show that it is possible to give a satisfying tradeoff between privacy and accuracy for a computational problem called independent component analysis (ICA), which seeks to decompose an observed signal into its underlying independent source variables. We do this by releasing a perturbation of a compact representation of the observed data. This approach allows us to preserve individual privacy while releasing information that can be used to reconstruct the underlying relationship between the observed variables. In almost all of the differential privacy literature, the privacy requirement must be specified before looking at the data, and the noise added for privacy limits the statistical utility of the sanitized data. The third part of this dissertation ties together privacy and strategic behavior to answer the question of how to determine an appropriate level of privacy when data contributors prefer more privacy but an analyst prefers more accuracy. The proposed solution to this problem views privacy as a public good and uses market design techniques to collect these preferences and then privately select and enforce a socially efficient level of privacy.
APA, Harvard, Vancouver, ISO, and other styles
4

Jiao, Zhuoan. "Optimisation studies in a Prolog object-oriented database." Thesis, University of Aberdeen, 1992. http://digitool.abdn.ac.uk/R?func=search-advanced-go&find_code1=WSN&request1=AAIU047556.

Full text
Abstract:
This thesis is about query optimisation studies in a Prolog object-oriented database (P/FDM). Although many of the query optimisation techniques used in relational database systems can be adapted to solve problems in query optimisation for object-oriented databases (OODBs), there are also many problems that are unique to the OODBs, and new techniques need to be developed. Techniques developed for optimising queries in OODB systems can be categorised into three distinct approaches, namely, algebraic transformation, type-based transformation, and method optimisation. However, few OODB systems have used the combination of all three techniques in the design of their query optimisers. We have adopted an unified approach by combining them into the optimisation strategy of a query optimiser for P/FDM. The overall architecture of the P/FDM query optimiser is based on the top-down framework. The source language of the query optimiser is an extension of Shipman's original DAPLEX language. We choose ZF notation, based on set comprehensions in Zermelo-Frankel (ZF) set theory, to represent the intermediate forms of DAPLEX queries. The target language of optimiser is a set of P/FDM primitives which are implemented in Prolog. We have taken the approach of asking the database to reveal the definitions of methods to the optimiser as privileged code. Most OODB systems do not perform method optimisation because of the difficulties caused by defining methods in a procedural programming language. We have been greatly helped by using a functional programming approach which holds methods in a declarative form, and thus makes it much easier to combine and transform them. Heuristics are incorporated into the query optimisation strategy to avoid exhaustive search, so that the optimiser is able to produce efficient query evaluation plans within satisfactory response times.
APA, Harvard, Vancouver, ISO, and other styles
5

Peng, Yun. "Estimation techniques for advanced database applications." HKBU Institutional Repository, 2013. https://repository.hkbu.edu.hk/etd_ra/1526.

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

Aggarwal, Pooja. "Theory and applications of non-blocking slot schedulers." Thesis, IIT Delhi, 2016. http://localhost:8080/iit/handle/2074/7041.

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

Picalausa, Francois. "Guarded structural indexes: theory and application to relational RDF databases." Doctoral thesis, Universite Libre de Bruxelles, 2013. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209432.

Full text
Abstract:
Ces dernières années ont vu un regain d’intérêt dans l’utilisation de données semi-structurées, grâce à la standardisation de formats d’échange de données sur le Web tels que XML et RDF. On notera en particulier le Linking Open Data Project qui comptait plus de 31 milliard de triplets RDF à la fin de l’année 2011. XML reste, pour sa part, l’un des formats de données privilégié de nombreuses bases de données de grandes tailles dont Uniprot, Open Government Initiative et Penn Treebank.

Cet accroissement du volume de données semi-structurées a suscité un intérêt croissant pour le développement de bases de données adaptées. Parmi les différentes approches proposées, on peut distinguer les approches relationnelles et les approches graphes, comme détaillé au Chapitre 3. Les premières visent à exploiter les moteurs de bases de données relationnelles existants, en y intégrant des techniques spécialisées. Les secondes voient les données semistructurées comme des graphes, c’est-à-dire un ensemble de noeuds liés entre eux par des arêtes étiquetées, dont elles exploitent la structure. L’une des techniques de ce domaine, connue sous le nom d’indexation structurelle, vise à résumer les graphes de données, de sorte à pouvoir identifier rapidement les données utiles au traitement d’une requête.

Les index structurels classiques sont construits sur base des notions de simulation et de bisimulation sur des graphes. Ces notions, qui sont d’usage dans de nombreux domaines tels que la vérification, la sécurité, et le stockage de données, sont des relations sur les noeuds des graphes. Fondamentalement, ces notions caractérisent le fait que deux noeuds partagent certaines caractéristiques telles qu’un même voisinage.

Bien que les approches graphes soient efficaces en pratique, elles présentent des limitations dans le cadre de RDF et son langage de requêtes SPARQL. Les étiquettes sont, dans cette optique, distinctes des noeuds du graphe .Dans le modèle décrit par RDF et supporté par SPARQL, les étiquettes et noeuds font néanmoins partie du même ensemble. C’est pourquoi, les approches graphes ne supportent qu’un sous-ensemble des requêtes SPARQL. Au contraire, les approches relationnelles sont fidèles au modèle RDF, et peuvent répondre au différentes requêtes SPARQL.

La question à laquelle nous souhaitons répondre dans cette thèse est de savoir si les approches relationnelles et graphes sont incompatible, ou s’il est possible de les combiner de manière avantageuse. En particulier, il serait souhaitable de pouvoir conserver la performance des approches graphe, et la généralité des approches relationnelles. Dans ce cadre, nous réalisons un index structurel adapté aux données relationnelles.

Nous nous basons sur une méthodologie décrite par Fletcher et ses coauteurs pour la conception d’index structurels. Cette méthodologie repose sur trois composants principaux. Un premier composant est une caractérisation dite structurelle du langage de requêtes à supporter. Il s’agit ici de pouvoir identifier les données qui sont retournées en même temps par n’importe quelle requête du langage aussi précisément que possible. Un second composant est un algorithme qui doit permettre de grouper efficacement les données qui sont retournées en même temps, d’après la caractérisation structurelle. Le troisième composant est l’index en tant que tel. Il s’agit d’une structure de données qui doit permettre d’identifier les groupes de données, générés par l’algorithme précédent pour répondre aux requêtes.

Dans un premier temps, il faut remarquer que le langage SPARQL pris dans sa totalité ne se prête pas à la réalisation d’index structurels efficaces. En effet, le fondement des requêtes SPARQL se situe dans l’expression de requêtes conjonctives. La caractérisation structurelle des requêtes conjonctives est connue, mais ne se prête pas à la construction d’algorithmes efficaces pour le groupement. Néanmoins, l’étude empirique des requêtes SPARQL posées en pratique que nous réalisons au Chapitre 5 montre que celles-ci sont principalement des requêtes conjonctives acycliques. Les requêtes conjonctives acycliques sont connues dans la littérature pour admettre des algorithmes d’évaluation efficaces.

Le premier composant de notre index structurel, introduit au Chapitre

6, est une caractérisation des requêtes conjonctives acycliques. Cette

caractérisation est faite en termes de guarded simulation. Pour les graphes la

notion de simulation est une version restreinte de la notion de bisimulation.

Similairement, nous introduisons la notion de guarded simulation comme une

restriction de la notion de guarded bisimulation, une extension connue de la

notion de bisimulation aux données relationelles.

Le Chapitre 7 offre un second composant de notre index structurel. Ce composant est une structure de données appelée guarded structural index qui supporte le traitement de requêtes conjonctives quelconques. Nous montrons que, couplé à la caractérisation structurelle précédente, cet index permet d’identifier de manière optimale les données utiles au traitement de requêtes conjonctives acycliques.

Le Chapitre 8 constitue le troisième composant de notre index structurel et propose des méthodes efficaces pour calculer la notion de guarded simulation. Notre algorithme consiste essentiellement en une transformation d’une base de données en un graphe particulier, sur lequel les notions de simulation et guarded simulation correspondent. Il devient alors possible de réutiliser les algorithmes existants pour calculer des relations de simulation.

Si les chapitres précédents définissent une base nécessaire pour un index structurel visant les données relationnelles, ils n’intègrent pas encore cet index dans le contexte d’un moteur de bases de données relationnelles. C’est ce que propose le Chapitre 9, en développant des méthodes qui permettent de prendre en compte l’index durant le traitement d’une requête SPARQL. Des résultats expérimentaux probants complètent cette étude.

Ce travail apporte donc une première réponse positive à la question de savoir s’il est possible de combiner de manière avantageuse les approches relationnelles et graphes de stockage de données RDF.


Doctorat en Sciences de l'ingénieur
info:eu-repo/semantics/nonPublished

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

Kim, Pilho. "E-model event-based graph data model theory and implementation /." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29608.

Full text
Abstract:
Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2010.
Committee Chair: Madisetti, Vijay; Committee Member: Jayant, Nikil; Committee Member: Lee, Chin-Hui; Committee Member: Ramachandran, Umakishore; Committee Member: Yalamanchili, Sudhakar. Part of the SMARTech Electronic Thesis and Dissertation Collection.
APA, Harvard, Vancouver, ISO, and other styles
9

Moreau, Aurélien. "How fuzzy set theory can help make database systems more cooperative." Thesis, Rennes 1, 2018. http://www.theses.fr/2018REN1S043/document.

Full text
Abstract:
Dans ces travaux de thèse nous proposons de tirer parti de la théorie des ensembles flous afin d'améliorer les interactions entre les systèmes de bases de données et les utilisateurs. Les mécanismes coopératifs visent à aider les utilisateurs à mieux interagir avec les SGBD. Ces mécanismes doivent faire preuve de robustesse : ils doivent toujours pouvoir proposer des réponses à l'utilisateur. Empty set (0,00 sec) est un exemple typique de réponse qu'il serait désirable d'éradiquer. Le caractère informatif des explications de réponses est parfois plus important que les réponses elles-mêmes : ce peut être le cas avec les réponses vides et pléthoriques par exemple, d'où l'intérêt de mécanismes coopératifs robustes, capables à la fois de contribuer à l'explication ainsi qu'à l'amélioration des résultats. Par ailleurs, l'utilisation de termes de la langue naturelle pour décrire les données permet de garantir l'interprétabilité des explications fournies. Permettre à l'utilisateur d'utiliser des mots de son propre vocabulaire contribue à la personnalisation des explications et améliore l'interprétabilité. Nous proposons de nous intéresser aux explications dans le contexte des réponses coopératives sous trois angles : 1) dans le cas d'un ensemble pléthorique de résultats ; 2) dans le contexte des systèmes de recommandation ; 3) dans le cas d'une recherche à partir d'exemples. Ces axes définissent des approches coopératives où l'intérêt des explications est de permettre à l'utilisateur de comprendre comment sont calculés les résultats proposés dans un effort de transparence. Le caractère informatif des explications apporte une valeur ajoutée aux résultats bruts, et forme une réponse coopérative
In this thesis, we are interested in how we can leverage fuzzy logic to improve the interactions between relational database systems and humans. Cooperative answering techniques aim to help users harness the potential of DBMSs. These techniques are expected to be robust and always provide answer to users. Empty set (0,00 sec) is a typical example of answer that one may wish to never obtain. The informative nature of explanations is higher than that of actual answers in several cases, e.g. empty answer sets and plethoric answer sets, hence the interest of robust cooperative answering techniques capable of both explaining and improving an answer set. Using terms from natural language to describe data --- with labels from fuzzy vocabularies --- contributes to the interpretability of explanations. Offering to define and refine vocabulary terms increases the personalization experience and improves the interpretability by using the user's own words. We propose to investigate the use of explanations in a cooperative answering setting using three research axes: 1) in the presence of a plethoric set of answers; 2) in the context of recommendations; 3) in the context of a query/answering problem. These axes define cooperative techniques where the interest of explanations is to enable users to understand how results are computed in an effort of transparency. The informativeness of the explanations brings an added value to the direct results, and that in itself represents a cooperative answer
APA, Harvard, Vancouver, ISO, and other styles
10

Nelson, David Alan. "To formalise and implement a categorical object-related database system." Thesis, University of Newcastle Upon Tyne, 1999. http://hdl.handle.net/10443/2078.

Full text
Abstract:
The relational data model uses set theory to provide a formal background, thus ensuring a rigorous mathematical data model with support for manipulation. Newer generation database models are based on the object-oriented paradigm, and so fall short of having such a formal background, especially in some of the more complex data manipulation areas. We use category theory to provide a formalism for object databases, in particular the object-relational model. Our model is known as the Product Model. This thesis will describe our formal model for the key aspects of object databases. In particular, we will examine how the Product Model deals with three of the most important problems inherent in object databases, those of queries, closure and views. As well as this, we investigate the more common database concepts, such as keys, relationships and aggregation. We will illustrate the feasibility of this model, by producing a prototype implementation using PIFDM. PIFDM is a semantic data model database system based on the functional model of Shipman, with object-oriented extensions.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Database theory"

1

Léonard, Michel. Database Design Theory. London: Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-11979-0.

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

1951-, De Antonellis Valeria, ed. Relational database theory. Redwood City, Calif: Benjamin/Cummings Pub. Co., 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Leonard, Michel. Database design theory. London: Macmillan, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Léonard, M. Database design theory. Houndmills, Basingstoke, Hampshire: Macmillan, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Date, C. J. Database in depth: Relational theory for practitioners. Beijing: O'Reilly, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Frank, Lars. Database: Theory and practice. Workingham, England: Addison-Wesley, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Afrati, Foto, and Phokion Kolaitis, eds. Database Theory — ICDT '97. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62222-5.

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

Calvanese, Diego, Maurizio Lenzerini, and Rajeev Motwani, eds. Database Theory — ICDT 2003. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-36285-1.

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

Beeri, Catriel, and Peter Buneman, eds. Database Theory — ICDT’99. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-49257-7.

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

Biskup, Joachim, and Richard Hull, eds. Database Theory — ICDT '92. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-56039-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Database theory"

1

Samet, Ahmed, Éric Lefèvre, and Sadok Ben Yahia. "Evidential Database: A New Generalization of Databases?" In Belief Functions: Theory and Applications, 105–14. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11191-9_12.

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

Plotkin, B. "Constructions in Database Theory." In Universal Algebra, Algebraic Logic, and Databases, 365–88. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-0820-1_16.

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

Resconi, Germano, Xiaolin Xu, and Guanglin Xu. "Database and Graph Theory." In Introduction to Morphogenetic Computing, 1–11. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-57615-2_1.

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

Léonard, Michel. "A relational data model." In Database Design Theory, 3–30. London: Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-11979-0_1.

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

Léonard, Michel. "Perspectives." In Database Design Theory, 219–48. London: Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-11979-0_10.

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

Léonard, Michel. "Integrity rules." In Database Design Theory, 31–82. London: Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-11979-0_2.

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

Léonard, Michel. "Introduction and access paths graph." In Database Design Theory, 85–100. London: Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-11979-0_3.

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

Léonard, Michel. "Transformation of a decomposition into a relation graph." In Database Design Theory, 101–15. London: Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-11979-0_4.

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

Léonard, Michel. "From a relation graph to an internal data structure." In Database Design Theory, 116–38. London: Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-11979-0_5.

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

Léonard, Michel. "Choosing a relation decomposition." In Database Design Theory, 141–63. London: Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-11979-0_6.

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

Conference papers on the topic "Database theory"

1

Rabuzin, Kornelije, Sonja Ristić, and Robert Kudelić. "GRAPH DATABASE MANAGEMENT SYSTEMS AND GRAPH THEORY." In Fourth International Scientific Conference ITEMA Recent Advances in Information Technology, Tourism, Economics, Management and Agriculture. Association of Economists and Managers of the Balkans, Belgrade, Serbia, 2020. http://dx.doi.org/10.31410/itema.2020.39.

Full text
Abstract:
In recent years, graph databases have become far more important. They have been proven to be an excellent choice for storing and managing large amounts of interconnected data. Since graph databases (GDB) rely on a graph data model based on graph theory, this study examines whether currently available graph database management systems support the principles of graph theory, and, if so, to what extent. We also show how these systems differ in terms of implementation and languages, and we also discuss which graph database management systems are used today and why.
APA, Harvard, Vancouver, ISO, and other styles
2

Beaubouef, Theresa, and Frederick E. Petry. "Database security issues in rough relational databases." In 2010 42nd Southeastern Symposium on System Theory (SSST 2010). IEEE, 2010. http://dx.doi.org/10.1109/ssst.2010.5442811.

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

Dietrich, Suzanne W., and Susan D. Urban. "Database theory in practice." In the twenty-seventh SIGCSE technical symposium. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/236452.236520.

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

Chandra, Ashok K. "Theory of database queries." In the seventh ACM SIGACT-SIGMOD-SIGART symposium. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/308386.308396.

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

Kolaitis, Phokion G. "Combinatorial games in database theory." In the fourteenth ACM SIGACT-SIGMOD-SIGART symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/212433.212461.

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

Cosmadakis, Stavros S. "Database theory and cylindric lattices." In 28th Annual Symposium on Foundations of Computer Science. IEEE, 1987. http://dx.doi.org/10.1109/sfcs.1987.17.

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

Jha, Abhay, and Dan Suciu. "Knowledge compilation meets database theory." In the 14th International Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1938551.1938574.

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

Ullman, J. D. "Database theory---past and future." In the sixth ACM SIGACT-SIGMOD-SIGART symposium. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/28659.28660.

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

Vardi, Moshe Y. "Constraint satisfaction and database theory." In the nineteenth ACM SIGMOD-SIGACT-SIGART symposium. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/335168.335209.

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

Kim, Ji-Eun, and Yun-Jeong Choi. "A Methodology of Predicting Market Convergence Opportunity Using Machine Learning for Small and Mid-Size Enterprises." In Database Theory and Application 2016. Science & Engineering Research Support soCiety, 2016. http://dx.doi.org/10.14257/astl.2016.142.26.

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

Reports on the topic "Database theory"

1

Ulman, J. D. Database Theory. Fort Belvoir, VA: Defense Technical Information Center, February 1985. http://dx.doi.org/10.21236/ada158975.

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

Karonis, N. T., and M. R. Kraimer. Links in a distributed database: Theory and implementation. Office of Scientific and Technical Information (OSTI), December 1991. http://dx.doi.org/10.2172/205215.

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

Ruff, Elizabeth, Robert Reardon, and Sara Bertoch. Creating a Research Database on Holland's Theory and Practical Tools: Technical Report No. 47. Florida State University Libraries, November 2007. http://dx.doi.org/10.17125/fsu.1525974722.

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

Hill, Christian. International Atomic and Molecular Code Centres Network: Database Services for Radiation Damage in Nuclear Materials. IAEA Nuclear Data Section, January 2020. http://dx.doi.org/10.61092/iaea.agtk-r4gy.

Full text
Abstract:
The International Code Centres Network (CCN) is a group of experts developing codes and models for atomic, molecular and plasma-surface interaction data relevant to fusion applications. Variable subsets of the group are brought together by the IAEA Atomic and Molecular Data (AMD) Unit in order to discuss computational and scientific issues associated with code developments. At the 6th Technical Meeting described in this report, 11 experts in the field of Molecular Dynamics (MD) simulations of radiation damage reviewed CascadesDB, a database of atomic configurations generated by MD simulations of collision cascades. This database is developed and hosted by the AMD Unit and provides a central repository for the results of MD simulations of the evolution of a material’s structure following an impact by a high energy particle. Further plans to extend and enhance CascadesDB, and to establish a new database resource, DefectDB, containing density functional theory calculations of defect structures were also discussed.
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Bin, Cimin Shen, Na Li, Lu Wang, and Dangdang Chen. Thermotherapy for shoulder pain: a protocol for systematic review. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, November 2021. http://dx.doi.org/10.37766/inplasy2021.11.0086.

Full text
Abstract:
Review question / Objective: Shoulder pain is a common musculoskeletal disorder prompting many patients to seek treatment. Thermotherapy is a common treatment for shoulder which has been widely used in hospitals. But its efficiency has not been scientifically and methodically evaluated. This protocol aims to evaluate the efficacy and safety of Thermotherapy for treating shoulder pain. Information sources: Eight databases will be searched from their inception to October 2021. They are as follows: PubMed, Embase, Cochrane Library, ClinicalTrials.gov, China Knowledge Resource Integrated Database (CNKI), Weipu Database for Chinese Technical Periodicals (VIP), Chinese Biomedical Literature Database (CBM), and Wanfang Database. There will be no limitation to study publication status or language. The search terms include shoulder impingement syndrome, rotator cuff, bursitis, adhesive capsulitis, frozen shoulder, shoulder pain, thermotherapy, diathermy, heat therapy, Moxibustion, and RCTs. The equivalent search words will be used in the Chinese databases.
APA, Harvard, Vancouver, ISO, and other styles
6

Minor, Peter, and Terrie Walmsley. MyGTAP: A Program for Customizing and Extending the GTAP Database for Multiple Households, Split Factors, Remittances, Foreign Aid and Transfers. GTAP Working Paper, December 2013. http://dx.doi.org/10.21642/gtap.wp79.

Full text
Abstract:
The GTAP standard model has proved a useful analysis tool and data source for over 20 years. The GTAP model has been updated overtime, but it maintains the structure of a single regional household, with income distributed into three components: government, private and savings-investment expenditures. There has been a need for a more detailed accounting system, especially as it relates to estimating the potential impacts of policies and global shocks on poverty, sustainable and inclusive growth. This paper (and its companion paper) present a method for splitting the GTAP regional household and linking these households to factor incomes and taxes. It introduces a user friendly GEMPACK based application, MyGTAP, for splitting the GTAP regional household based on basic data and splitting shares which may be obtained from a Social Accounting Matrix (SAM); this greatly reduces the development requirements for introducing multiple households into the GTAP model. The introduction of a split regional household (which does not require splitting data for every region) supports economic analysis based on detailed households, government, factor income, remittances, foreign aid and income transfers. The splitting method is based on the normalized GTAP database found in SplitCom, however, it is shown in the paper that this approach is easily reconciled and is consistent within a SAM framework. The code can be modified to include multiple split regions with unique household structures. This paper is a guide to employing the data tools and programs for splitting the regional household and factors of production in the GTAP database. It is intended to be used in tandem with a complimentary paper detailing the theory, accounting and model code "MyGTAP Model: A Model for Employing Data from the MyGTAP Data Program: Multiple Households, Split Factors, Remittances, Foreign Aid, and Transfers”, GTAP Working Paper No. 78, by Walmsley and Minor 2013.
APA, Harvard, Vancouver, ISO, and other styles
7

Tan, Aihua, Yan Hu, Han Yan, Zheng Zhang, Ziyu Song, and Simiao Ran. Efficacy and safety of Chinese Herbal Medicine for Vascular dementia: A protocol of systematic review and meta-analysis. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, January 2022. http://dx.doi.org/10.37766/inplasy2022.1.0098.

Full text
Abstract:
Review question / Objective: As a common type of clinical dementia, the prevalence rate of vascular dementia(VaD) increased rapidly in recent years, damaging both patients’ health and social-economic prospect. There is currently no effective treatment for VaD, though western medicines can slightly improve patients' cognitive function, but not brought a significant improvement in daily life ability. Chinese herbal medicine(CHM) has been widely employed to treat dementia for more than 2000 years in China. Despite the proliferation of relevant literature, there is still a lack of evidence to prove the effectiveness and safety of such therapy. Therefore, this systematic review and meta-analysis protocol is aimed to assess the efficacy and safety of CHM forVaD. Information sources: 6 English databases (PubMed, Web of Science, Embase, Springer, CENTRAL and WHO International Clinical Trials Registry Platform) and 4 Chinese databases (Wan fang Database, Chinese Scientific Journals Database, China National Knowledge Infrastructure Database and Chinese Biomedical Literature Database).
APA, Harvard, Vancouver, ISO, and other styles
8

Walmsley, Terrie. Long Run Simulations With GTAP: Illustrative Results from APEC Trade Liberalisation. GTAP Technical Paper, September 2000. http://dx.doi.org/10.21642/gtap.tp09.

Full text
Abstract:
In static applied general equilibrium models, the exogenous/endogenous split between variables (or closure) is used to infer the time frame over which the effects of a shock are simulated. This paper introduces a long-run closure for the GTAP model (Hertel and Tsigas, 1997) and uses this closure to simulate and compare the short-run and long-run effects of Asia-Pacific trade liberalisation. The approach explored here incorporates some relatively minor changes to existing GTAP theory in order to define a steady state in which growth rates of all real variables are uniform. Such uniformity must apply in the initial database (as well as in the post-shock solution). So to implement the new long run in GTAP a new initial database must first be created. Details concerning the creation of the new database are given, and results under the new approach are compared with those obtained under the old. The emphasis of this paper is on the development of a long-run closure in which the percentage change form equations of the model and the relationships between the levels variables in the GTAP database are consistent. Further research is required into these types of long-run closures to incorporate changes in ownership of capital to ensure that changes in welfare are adequately modelled. In the results reported here, GDP is not a useful guide to national welfare. The long-run closures introduced here are also compared with another comparative static long-run closure developed for GTAP by Francois, MacDonald and Nordström (1996). Technical Paper Number 9 can be downloaded in PDF format. To print this you will need the Adobe Acrobat Reader. For those interested in replicating the results in this technical paper, an associated zip file can be downloaded. The zip file includes a readme file with detailed instructions.
APA, Harvard, Vancouver, ISO, and other styles
9

Kin, Eunjin, Jungyoon Choi, and Sang Yeon Min. Efficacy and safety of herbal medicines external application with Tuina in congenital muscular torticollis : A systematic review and meta-analysis protocol. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, January 2022. http://dx.doi.org/10.37766/inplasy2022.1.0017.

Full text
Abstract:
Review question / Objective: By 3 to 4 months of age, infants can keep their necks upright and look into both eyes horizontally. But infants with CMT have a wry neck also known as a twisted neck. Complementary therapies have been commonly used to treat CMT, such as tuina, acupuncture, herbal medicine. Among them, external application of herbal medicine is non-surgical and non-invasive inventions so it can be used widely in East Asia. This review aims to evaluate any form of external application of herbal medicines in CMT, such as cream, oil, extract, form of patch, etc. Information sources: We will electronically search the following database 4 English databases(MEDLINE, PubMed, EMBASE, the Cochrane Central Register of Controlled Trials), 3 Chinese databases(China National Knowledge Infrastructure(CNKI), Chinese Scientific Journal Database(VIP), Wan Fang Database), 4 Korean medical databases(Oriental Medicine Advanced Searching Integrated System(OASIS), Korean Studies Information Service System(KISS), National Digital Science Links(NDSL), Research Information Sharing Service(RISS)) from their founding date to June 2022, without any language restrictions.
APA, Harvard, Vancouver, ISO, and other styles
10

Luo, Xuexing, Zheyu Zhang, Jue Wang, Qibiao Wu, and Guanghui Huang. Art therapy as a complementary therapy for schizophrenia: a meta-analysis of randomized controlled trials following the PRISMA guidelines. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, May 2022. http://dx.doi.org/10.37766/inplasy2022.5.0099.

Full text
Abstract:
Review question / Objective: How are the effects of art therapy on schizophrenia? Condition being studied: Schizophrenia is a chronic and severely disabling mental disorder that is associated with impairments in cognitive, emotional and psychosocial functioning affecting the prospect of recovery. (Jablensky, 2010; Leucht, 2014). Information sources: A comprehensive literature search will be carried out by two independent researchers (XX Luo and J Wang). Published studies will be retrieved in common databases including PubMed, Web of Science, ClinicalTrials.gov, Cochrane Library, Embase, China National Knowledge Infrastructure(CNKI), Wanfang Databases, the Chinese Scientific Journal Database, the Chinese Science Citation Database, and the Chinese Biomedical Literature Database from inception to May 30, 2022. In addition, we will search and evaluate the relevant systematic reviews and meta-analyses to select the potential studies from their references. No trial is excluded due to publication status or language.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Database theory' for particular source types:
Journal articles 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