A generic persistence model for CLP systems (and two useful implementations)

Correas Fernandez, Jesús and Gómez, J. M. and Carro Liñares, Manuel and Cabeza Gras, Daniel and Hermenegildo, Manuel V. (2004). A generic persistence model for CLP systems (and two useful implementations). In: "6th International Symposium, PADL 2004", June 18-19, 2004, Dallas, TX, USA. ISBN 9783540222538.

Description

Title: A generic persistence model for CLP systems (and two useful implementations)
Author/s:
  • Correas Fernandez, Jesús
  • Gómez, J. M.
  • Carro Liñares, Manuel
  • Cabeza Gras, Daniel
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: 6th International Symposium, PADL 2004
Event Dates: June 18-19, 2004
Event Location: Dallas, TX, USA
Title of Book: Practical Aspects of Declarative Languages
Date: 2004
ISBN: 9783540222538
Volume: 3057
Subjects:
Freetext Keywords: Prolog, Databases, Persistency, Query optimization, Bases de datos, Persistencia.
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (990kB) | Preview

Abstract

This paper describes a model of persistence in (C)LP languages and two different and practically very useful ways to implement this model in current systems. The fundamental idea is that persistence is a characteristic of certain dynamic predicates (Le., those which encapsulate state). The main effect of declaring a predicate persistent is that the dynamic changes made to such predicates persist from one execution to the next one. After proposing a syntax for declaring persistent predicates, a simple, file-based implementation of the concept is presented and some examples shown. An additional implementation is presented which stores persistent predicates in an external datábase. The abstraction of the concept of persistence from its implementation allows developing applications which can store their persistent predicates alternatively in files or databases with only a few simple changes to a declaration stating the location and modality used for persistent storage. The paper presents the model, the implementation approach in both the cases of using files and relational databases, a number of optimizations of the process (using information obtained from static global analysis and goal clustering), and performance results from an implementation of these ideas.

More information

Item ID: 14374
DC Identifier: http://oa.upm.es/14374/
OAI Identifier: oai:oa.upm.es:14374
Official URL: http://link.springer.com/chapter/10.1007%2F978-3-540-24836-1_8?LI=true
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 30 Jan 2013 07:26
Last Modified: 21 Apr 2016 14:00
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM