Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
MTZ-Fachkongress

Antriebe und Energiesysteme von morgen


Austausch von Automobil- und Energiewirtschaft

Am 14./15. Mai geht es in Chemnitz um die Mobilitätswende durch Elektro- und Wasserstofffahrzeuge.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
A Study of Argument Acceptability Dynamics Through Core and Remainder Sets Kapitel lesen Erstes Kapitel lesen

2016 | OriginalPaper | Buchkapitel

Maintenance of Queries Under Database Changes: A Unified Logic Based Approach

verfasst von : Elena V. Ravve

Erschienen in: Foundations of Information and Knowledge Systems

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This contribution deals with one single theme, the exploitation of logical reduction techniques in database theory. Two kinds of changes may be applied to databases: structural changes, known also as restructuring or schema evolution, and data changes. We present both of them in the terms of syntactically defined translation schemes.
At the same time, we have application programs, computing different queries on the database, which are oriented on some specific generation of the database. Systematically using the technique of translation scheme, we introduce the notion of \(\Phi \)-sums and show how queries, expressible in extensions of First Order Logic (FOL) may be handled over different generations of the \(\Phi \)-sums. Moreover, using the technique of translation scheme, we introduce the notions of an incremental view recomputations. We prove when queries expressible in extensions of FOL allow incremental view recomputations.
Our approach covers uniformly the cases we have encountered in the literature and can be applied to all existing query languages.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel The Challenge of Optional Matching in SPARQL
Nächstes Kapitel Selected Results and Related Issues of Confidentiality-Preserving Controlled Interaction Execution
Fußnoten
1
Note that in most real applications, \(F_{\phi }\) and the \(\psi _{\alpha ,j}\) are single exponential in the quantifier rank of \(\phi \).
 
Literatur
1.
Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)MATH
2.
Benedikt, M., Koch, C.: From XQuery to relational logics. ACM Trans. Database Syst. 34(4), 25:1–25:48 (2009)CrossRef
3.
Buneman, P., Khanna, S., Tan, W.-C.: On propagation of deletions and annotations through views. In: Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Madison, WI, 3–6 June 2002, pp. 150–158 (2002)
4.
Bosse, U.: Ehrenfeucht-Fraïssé Games for Fixed Point Logic. Ph.D. thesis. Department of Mathematics, University of Freiburg, Germany (1995)
5.
Bancilhon, F., Spyratos, N.: Update semantics of relational views. ACM Trans. Database Syst. 6(4), 557–575 (1981)CrossRefMATH
6.
Chang, C.C., Keisler, H.J.: Model Theory. Studies in Logic, 3rd edn. vol. 73. North-Holland, Amsterdam (1990)
7.
Codd, E.F.: A relational model of large shared data banks. Commun. ACM 13(2), 377–387 (1970)CrossRefMATH
8.
Dawar, A., Hellat, L.: The expressive power of finitely many genaralized quantifiers. Technical report CSR 24–93. Computer Science Department, University of Wales, University College of Swansea, UK (1993)
9.
10.
11.
Dong, G., Su, J.: Arity bounds in first-order incremental evaluation and definition of polynomial time database queries. J. Comput. Syst. Sci. 57(3), 289–308 (1998)MathSciNetCrossRefMATH
12.
Dong, G., Topor, R.: Incremental evaluation of Datalog queries. In: Hull, R., Biskup, J. (eds.) ICDT 1992. LNCS, vol. 646, pp. 282–296. Springer, Heidelberg (1992)CrossRef
13.
Dong, G., Zhang, L.: Separating auxiliary arity hierarchy of first-order incremental evaluation systems using (\(3k+1\))-ary input relations. Int. J. Found. Comput. Sci. 11(4), 573–578 (2000)MathSciNetCrossRefMATH
14.
Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin (1995)MATH
15.
Ebbinghaus, H.D., Flum, J., Thomas, W.: Mathematical Logic. Undergraduate Texts in Mathematics, 2nd edn. Springer, New York (1994)CrossRefMATH
16.
Franconi, E., Guagliardo, P.: On the translatability of view updates. In: Freire, J., Suciu, D. (eds.) AMW. CEUR Workshop Proceedings, vol. 866, pp. 154–167 (2012)
17.
Franconi, E., Guagliardo, P.: The view update problem revisited. CoRR abs/1211.3016 (2012)
18.
Franconi, E., Guagliardo, P.: Effectively updatable conjunctive views. In: Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management, Puebla/Cholula, Mexico, 21–23 May 2013
19.
Feferman, S., Vaught, R.: The first order properties of products of algebraic systems. Fundam. Math. 47, 57–103 (1959)MathSciNetMATH
20.
Guagliardo, P., Pichler, R., Sallinger, E.: Enhancing the updatability of projective views. In: Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management, Puebla/Cholula, Mexico, 21–23 May 2013
21.
Grädel, E., Siebertz, S.: Dynamic definability. In: Proceedings 15th International Conference on Database Theory ICDT, Berlin, Germany, 26–29 March 2012, pp. 236–248 (2012)
22.
23.
Guagliardo, P., Wieczorek, P.: Query processing in data integration. In: Kolaitis, P.G., Lenzerini, M., Schweikardt, N. (eds.) Data Exchange, Information, and Streams. Dagstuhl Follow-Ups, vol. 5, pp. 129–160. Schloss Dagstuhl, Leibniz-Zentrum für Informatik (2013)
24.
Hegner, S.J.: The relative complexity of updates for a class of database views. In: Seipel, D., Turull-Torres, J.M. (eds.) FoIKS 2004. LNCS, vol. 2942, pp. 155–175. Springer, Heidelberg (2004)CrossRef
25.
Immerman, N.: Descriptive Complexity. Graduate Texts in Computer Science. Springer, New York (1999)CrossRefMATH
26.
Koch, C.: Incremental query evaluation in a ring of databases. In: Proceedings of the 29th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Indianapolis, IN, 6–11 June 2010, pp. 87–98 (2010)
27.
Makowsky, J.A., Ravve, E.V.: BCNF via attribute splitting. In: Düsterhöft, A., Klettke, M., Schewe, K.-D. (eds.) Conceptual Modelling and Its Theoretical Foundations. LNCS, vol. 7260, pp. 73–84. Springer, Heidelberg (2012)CrossRef
28.
Quan, X., Wiederhold, G.: Incremental recomputation of active relational expressions. IEEE Trans. Knowl. Data Eng. 3(3), 337–341 (1991)CrossRef
29.
Rabin, M.O.: A simple method for undecidability proofs and some applications. In: Bar Hillel, Y. (ed.) Logic, Methodology and Philosophy of Science II. Studies in Logic, pp. 58–68. North Holland, (1965)
30.
Ravve, E.V., Volkovich, Z., Weber, G.-W.: A uniform approach to incremental reasoning on strongly distributed systems. In: Proceedings of GCAI2015 (2015, to appear)
31.
Weber, V., Schwentick, T.: Dynamic complexity theory revisited. In: Proceedings 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, 24–26 February 2005, pp. 256–268 (2005)
Metadaten
Titel
Maintenance of Queries Under Database Changes: A Unified Logic Based Approach
verfasst von
Elena V. Ravve
Copyright-Jahr
2016
Buch
Foundations of Information and Knowledge Systems

Print ISBN: 978-3-319-30023-8

Electronic ISBN: 978-3-319-30024-5

Copyright-Jahr: 2016

DOI
https://doi.org/10.1007/978-3-319-30024-5_11

Premium Partner

    Bildnachweise