Article

Free access

Referential actions as logical rules

Authors:

Bertram Ludäscher,

Wolfgang May,

Georg LausenAuthors Info & Claims

PODS '97: Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 217 - 227

https://doi.org/10.1145/263661.263685

Published: 01 May 1997 Publication History

PDF eReader

References

[1]

S. Abiteboul and V. Vianu. Datalog Extensions for Database Queries and Updates. Journal of Computer and System Sciences, 43(1):62-124, 1991.

Digital Library

Google Scholar

[2]

R. Cochrane, H. Pirahesh, and N. Mattes. Integrating Triggers and Declarative Constraints in SQL Database Sytems. In Prec. Intl. Conference on Very Large Data Bases, pages 567-578, Mumbat (Bombay), India, 1996.

Digital Library

Google Scholar

[3]

C. J. Date. Referential Integrity. In Prec. Intl. "Conference on Very Large Data Bases, pages 2-12, Cannes, France, March 1981. IEEE Computer Society Press.

Google Scholar

[4]

J. Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. In A. Fuhrmann and H. Rott, editors, Logic, Action and Information. de Gruyter, 1995.

Google Scholar

[5]

T. Eiter, N. Leone, and D. Sacch. The Expressive Power of Partial Models for Disjunctive Deductive Databases. In D. Pedreschi and C. Zaniolo, editors, Prec. Intl. Workshop on Logic in Databases (LID), number 1154 in LNCS, pages 197-222, San Miniato, Italy, 1996. Springer.

Digital Library

Google Scholar

[6]

B. M. Horowitz. A l~un-Time Execution Model for Referential Integrity Maintenance. In Prec. Intl. Conference on Data Engineering, pages 548-556, 1992.

Digital Library

Google Scholar

[7]

ISO/IEC JTC1/SC21. information Technology- Database Languages- SQL2, July 1992. ANSI, 1430 Broadway, New York, NY 10018.

Google Scholar

[8]

ISO/IEC JTC1/SC21/WG3. ISO/ANSI working draft Database Languages- SQL3, August 1994, J. Melton (Ed.), ANSI, 1430 Broadway, New York, NY 10018.

Google Scholar

[9]

B. Lud~cher, W. May, and G. Lausen. Triggers, Games, and Stable Models. Technical report, Institut fiir Informatik, Universit,it Freiburg, 1996. http://www.informatik.unifreiburg.de/-ludaesch/Paper/tgsm.ps.gz.

Google Scholar

[10]

B. Lud~cher, W. May, and J. Reinert. Towards a Logical Semantics for Referential Actions in SQL. In Prec. 6th Intl. Workshop on Foundations of Models and Languages for Data and Objects: Integrity in Daiabases~ Dagstuhl, Germany, 1996. http://ww~viti.cs,unimagdeburg.de/'conrad/IDB96/Proceedings.html,

Google Scholar

[11]

V. M. Markowitz. Safe Referential Integrity and Null Constraint Structures in Relational Databases. Information Systems, 19(4):359-378, 1994,

Digital Library

Google Scholar

[12]

P. Picouet and V. Vianu. Semantics and Expressiveness Issues in Active Databases. In Prec. A CM Symposium on Principles of Database Sys. tems, 1995.

Digital Library

Google Scholar

[13]

J. Reinert. Ambiguity for Referential Integrity is Undecidable. In G. Kuper and M. Wallace, editors, Constraint Databases and Applications, number 1034 in LNCS, pages 132-147. Springer, 1996,

Digital Library

Google Scholar

[14]

V. Vianu. Rule-Based Languages. Annals of Mathematics and Artificial Intelligence. to appear.

Digital Library

Google Scholar

Cited By

View all

Flouris GKonstantinidis GAntoniou GChristophides V(2012)Formal foundations for RDF/S KB evolutionKnowledge and Information Systems10.1007/s10115-012-0500-235:1(153-191)Online publication date: 17-May-2012
https://doi.org/10.1007/s10115-012-0500-2
Dey SZinn DLudäscher B(2011)PROPUBProceedings of the 23rd international conference on Scientific and statistical database management10.5555/2032397.2032414(225-243)Online publication date: 20-Jul-2011
https://dl.acm.org/doi/10.5555/2032397.2032414
Dey SZinn DLudäscher B(2011)ProPub: Towards a Declarative Approach for Publishing Customized, Policy-Aware ProvenanceScientific and Statistical Database Management10.1007/978-3-642-22351-8_13(225-243)Online publication date: 2011
https://doi.org/10.1007/978-3-642-22351-8_13
Show More Cited By

Index Terms

Referential actions as logical rules
1. Information systems
  1. Data management systems
    1. Database design and models
    2. Database management system engines
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics

Recommendations

Association Action Rules and Action Paths Triggered by Meta-actions
GRC '10: Proceedings of the 2010 IEEE International Conference on Granular Computing

Action rules are built from atomic expressions called atomic action terms and they describe possible transitions of objects from one state to another. They involve changes of values within one decision attribute. Association action rule is similar to an ...
Mining Meta-Actions for Action Rules Reduction
To Andrzej Skowron on His 70th Birthday

Meta-actions effect and selection are the fundamental core for a successful action rule execution. All atomic action terms on the left-hand side of an action rule have to be covered by well chosen meta-actions in order for it to be executed. The choice ...
Understanding the global semantics of referential actions using logic rules

Referential actions are specialized triggers for automatically maintaining referential integrity in databases. While the local effects of referential actions can be grasped easily, it is far from obvious what the global semantics of a set of interacting ...

Comments

Information & Contributors

Information

Published In

PODS '97: Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

May 1997

272 pages

ISBN:0897919106

DOI:10.1145/263661

Chairmen:
Alberto Mendelzon
Univ. of Toronto, Toronto, Ont., Canada
,
Z. Meral Özsoyoglu
Case Western Reserve Univ., Cleveland, OH

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS97

Sponsor:

SIGMOD

SIGMOD/PODS97: Joint ACM SIGMOD International Conference on Management of Data and ACM Symposium on Principles of Database Systems

May 11 - 15, 1997

Arizona, Tucson, USA

Acceptance Rates

PODS '97 Paper Acceptance Rate 23 of 118 submissions, 19%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
315
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)3

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Flouris GKonstantinidis GAntoniou GChristophides V(2012)Formal foundations for RDF/S KB evolutionKnowledge and Information Systems10.1007/s10115-012-0500-235:1(153-191)Online publication date: 17-May-2012
https://doi.org/10.1007/s10115-012-0500-2
Dey SZinn DLudäscher B(2011)PROPUBProceedings of the 23rd international conference on Scientific and statistical database management10.5555/2032397.2032414(225-243)Online publication date: 20-Jul-2011
https://dl.acm.org/doi/10.5555/2032397.2032414
Dey SZinn DLudäscher B(2011)ProPub: Towards a Declarative Approach for Publishing Customized, Policy-Aware ProvenanceScientific and Statistical Database Management10.1007/978-3-642-22351-8_13(225-243)Online publication date: 2011
https://doi.org/10.1007/978-3-642-22351-8_13
LudÄscher BMay W(2006)Referential actions: From logical semantics to implementationAdvances in Database Technology — EDBT'9810.1007/BFb0100999(404-418)Online publication date: 22-Nov-2006
https://doi.org/10.1007/BFb0100999
Chomicki JMarcinkowski J(2005)Minimal-change integrity maintenance using tuple deletionsInformation and Computation10.5555/1709465.1709573197:1-2(90-121)Online publication date: 1-Feb-2005
https://dl.acm.org/doi/10.5555/1709465.1709573
Chomicki JMarcinkowski J(2005)Minimal-change integrity maintenance using tuple deletionsInformation and Computation10.1016/j.ic.2004.04.007197:1-2(90-121)Online publication date: Feb-2005
https://doi.org/10.1016/j.ic.2004.04.007
Chomicki JMarcinkowski J(2005)On the Computational Complexity of Minimal-Change Integrity Maintenance in Relational DatabasesInconsistency Tolerance10.1007/978-3-540-30597-2_5(119-150)Online publication date: 2005
https://doi.org/10.1007/978-3-540-30597-2_5
Chomicki JMarcinkowski J(2004)On the computational complexity of minimal-change integrity maintenance in relational databasesInconsistency Tolerance10.5555/2137582.2137587(119-150)Online publication date: 1-Jan-2004
https://dl.acm.org/doi/10.5555/2137582.2137587
Lee SKim YKim H(2004)The semantics of an extended referential integrity for a multilevel secure relational data modelData & Knowledge Engineering10.1016/S0169-023X(03)00122-848:1(129-152)Online publication date: 1-Jan-2004
https://dl.acm.org/doi/10.1016/S0169-023X%2803%2900122-8
May WLudäscher B(2002)Understanding the global semantics of referential actions using logic rulesACM Transactions on Database Systems10.1145/582410.58241127:4(343-397)Online publication date: 1-Dec-2002
https://dl.acm.org/doi/10.1145/582410.582411
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Association Action Rules and Action Paths Triggered by Meta-actions

Mining Meta-Actions for Action Rules Reduction

Understanding the global semantics of referential actions using logic rules

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Association Action Rules and Action Paths Triggered by Meta-actions

Mining Meta-Actions for Action Rules Reduction

Understanding the global semantics of referential actions using logic rules

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations