Constraint-based approach to semistructured data

Mohand Saïd Hacid, Farouk Toumani, Ahmed Elmagarmid

Research output: Contribution to journalArticle

Abstract

In this paper we consider how constraint-based technology can be used to query semistructured data. As many concerns in semistructured data (e.g., representing and retrieving) are also found in computational linguistics, this last area could provide an interesting angle to attack some of the problems regarding semistructured data. We present a formalism based on feature logics1 for querying semistructured data. The formalism is a hybrid one in the sense that it combines clauses with path constraints. The resulting language has a clear declarative and operational semantics based on the notion of extended active domain.

Original languageEnglish
Pages (from-to)53-73
Number of pages21
JournalFundamenta Informaticae
Volume47
Issue number1-2
Publication statusPublished - 1 Jul 2001
Externally publishedYes

Fingerprint

Computational linguistics
Semistructured Data
Semantics
Computational Linguistics
Operational Semantics
Attack
Query
Angle
Path

Keywords

  • Constraints
  • Feature Logics
  • Path Expressions
  • Rule-Based Languages
  • Semistructured Data

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Applied Mathematics
  • Safety, Risk, Reliability and Quality

Cite this

Constraint-based approach to semistructured data. / Hacid, Mohand Saïd; Toumani, Farouk; Elmagarmid, Ahmed.

In: Fundamenta Informaticae, Vol. 47, No. 1-2, 01.07.2001, p. 53-73.

Research output: Contribution to journalArticle

Hacid, MS, Toumani, F & Elmagarmid, A 2001, 'Constraint-based approach to semistructured data', Fundamenta Informaticae, vol. 47, no. 1-2, pp. 53-73.
Hacid, Mohand Saïd ; Toumani, Farouk ; Elmagarmid, Ahmed. / Constraint-based approach to semistructured data. In: Fundamenta Informaticae. 2001 ; Vol. 47, No. 1-2. pp. 53-73.
@article{31177d3c7fef41a3b3eb833329510eb7,
title = "Constraint-based approach to semistructured data",
abstract = "In this paper we consider how constraint-based technology can be used to query semistructured data. As many concerns in semistructured data (e.g., representing and retrieving) are also found in computational linguistics, this last area could provide an interesting angle to attack some of the problems regarding semistructured data. We present a formalism based on feature logics1 for querying semistructured data. The formalism is a hybrid one in the sense that it combines clauses with path constraints. The resulting language has a clear declarative and operational semantics based on the notion of extended active domain.",
keywords = "Constraints, Feature Logics, Path Expressions, Rule-Based Languages, Semistructured Data",
author = "Hacid, {Mohand Sa{\"i}d} and Farouk Toumani and Ahmed Elmagarmid",
year = "2001",
month = "7",
day = "1",
language = "English",
volume = "47",
pages = "53--73",
journal = "Fundamenta Informaticae",
issn = "0169-2968",
publisher = "IOS Press",
number = "1-2",

}

TY - JOUR

T1 - Constraint-based approach to semistructured data

AU - Hacid, Mohand Saïd

AU - Toumani, Farouk

AU - Elmagarmid, Ahmed

PY - 2001/7/1

Y1 - 2001/7/1

N2 - In this paper we consider how constraint-based technology can be used to query semistructured data. As many concerns in semistructured data (e.g., representing and retrieving) are also found in computational linguistics, this last area could provide an interesting angle to attack some of the problems regarding semistructured data. We present a formalism based on feature logics1 for querying semistructured data. The formalism is a hybrid one in the sense that it combines clauses with path constraints. The resulting language has a clear declarative and operational semantics based on the notion of extended active domain.

AB - In this paper we consider how constraint-based technology can be used to query semistructured data. As many concerns in semistructured data (e.g., representing and retrieving) are also found in computational linguistics, this last area could provide an interesting angle to attack some of the problems regarding semistructured data. We present a formalism based on feature logics1 for querying semistructured data. The formalism is a hybrid one in the sense that it combines clauses with path constraints. The resulting language has a clear declarative and operational semantics based on the notion of extended active domain.

KW - Constraints

KW - Feature Logics

KW - Path Expressions

KW - Rule-Based Languages

KW - Semistructured Data

UR - http://www.scopus.com/inward/record.url?scp=0035401755&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035401755&partnerID=8YFLogxK

M3 - Article

VL - 47

SP - 53

EP - 73

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

IS - 1-2

ER -