loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Sergio Greco ; Cristian Molinaro and Francesco Parisi

Affiliation: DEIS, University of Calabria, Italy

ISBN: 978-972-8865-88-7

ISSN: 2184-4992

Keyword(s): Deductive databases, prioritized queries, preferences.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence and Decision Support Systems ; Biomedical Engineering ; Coupling and Integrating Heterogeneous Data Sources ; Data Engineering ; Databases and Information Systems Integration ; Enterprise Information Systems ; Health Information Systems ; Information Systems Analysis and Specification ; Knowledge Management ; Ontologies and the Semantic Web ; Society, e-Business and e-Government ; Verification and Validation of Knowledge-Based Systems ; Web Information Systems and Technologies

Abstract: The paper proposes the use of preferences for querying databases. In expressing queries it is natural to express preferences among tuples belonging to the answer. This can be done in commercial DBMS, for instance, by ordering the tuples in the result. The paper presents a different proposal, based on similar approaches deeply investigated in the artificial intelligence field, where preferences are used to restrict the result of queries posed over databases. In our proposal a query over a database DB is a triple (q, P, Φ), where q denotes the output relation, P a Datalog program (or an SQL query) used to compute the result and Φ is a set of preference rules used to introduce preferences on the computed tuples. In our proposal tuples which are ”dominated” by other tuples do not belong to the result and cannot be used to infer other tuples. A new stratified semantics is presented where the program P is partitioned into strata and the preference rules associated to each stratum of P are d ivided into layers; the result of a query is carried out by computing one stratum at time and by applying the preference rules, one layer at time. We show that our technique is sound and that the complexity of computing queries with preference rules is still polynomial. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.235.30.155

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Greco S.; Molinaro C.; Parisi F. and (2007). PREFERENCE RULES IN DATABASE QUERYING.In Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 3: ICEIS, ISBN 978-972-8865-88-7, pages 119-124. DOI: 10.5220/0002389901190124

@conference{iceis07,
author={Sergio Greco and Cristian Molinaro and Francesco Parisi},
title={PREFERENCE RULES IN DATABASE QUERYING},
booktitle={Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 3: ICEIS,},
year={2007},
pages={119-124},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002389901190124},
isbn={978-972-8865-88-7},
}

TY - CONF

JO - Proceedings of the Ninth International Conference on Enterprise Information Systems - Volume 3: ICEIS,
TI - PREFERENCE RULES IN DATABASE QUERYING
SN - 978-972-8865-88-7
AU - Greco, S.
AU - Molinaro, C.
AU - Parisi, F.
PY - 2007
SP - 119
EP - 124
DO - 10.5220/0002389901190124

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.