Titlebook: Conceptual Modeling - ER 2009; 28th International C Alberto H. F. Laender,Silvana Castano,José Palazzo Conference proceedings 2009 Springer

CYN

豐富

Tractable Query Answering over Conceptual Schemataschemata. We present an algorithm, based on query rewriting, that is capable of dealing with such EER schemata, while achieving tractability. We show that further negative constraints can be added to the EER formalism, while still keeping query answering tractable. We show that our formalism is gene

enumaerate

STERN

0302-9743 ues for transforming conceptual models into effective implementations. The scientific program of ER 2009 features several activities running in parallel.978-3-642-04839-5978-3-642-04840-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

flutter

https://doi.org/10.1007/978-3-030-99676-5ey ideas. We then note some open challenges and report on-going research, covering topics such as the representation of variability in conceptual models, capturing model intentions, and models of laws.. A keynote with a similar title was given 12 years ago at CAiSE’97, hence the ”part II”. The resea

口訣

占線

包裹

Overthrow

https://doi.org/10.1007/978-3-030-16107-1schemata. We present an algorithm, based on query rewriting, that is capable of dealing with such EER schemata, while achieving tractability. We show that further negative constraints can be added to the EER formalism, while still keeping query answering tractable. We show that our formalism is gene

滑動(dòng)

Toward a Biopsychosocial Welfare State?on template match. A scoring function, IR inspired, evaluates the relevance of the substructures and of the clusters, and supports the generation of Top-k solutions during its execution in the first k steps. Experiments demonstrate the effectiveness of our approach.