Scaffolding Relational Schemas and APIs from Content in Web Mockups

2017 ◽  
pp. 149-163
Author(s):  
Alfonso Murolo ◽  
Sybil Ehrensberger ◽  
Zera Asani ◽  
Moira C. Norrie
Keyword(s):  
Relational Schemas

Childhood Abuse and Later Interpersonal Resilience or Revictimization: The Importance of Core Relational Schemas

2012 ◽  
Author(s):  
Margaret O. Wright ◽  
Susan F. Folger ◽  
Carolyn R. Shainheit
Keyword(s):  
Childhood Abuse ◽  
Relational Schemas

Taking symbols for granted? Is the discontinuity between human and nonhuman minds the product of external symbol systems?

2008 ◽  
Vol 31 (2) ◽  
pp. 140-141 ◽  
Author(s):  
Gary Lupyan
Keyword(s):  
Human Performance ◽  
Symbol Systems ◽  
Relational Schemas ◽  
Language And Culture ◽  
Convincing Argument ◽  
Target Article ◽  
Nonhuman Animals ◽  
Substantial Degree

AbstractThe target article provides a convincing argument that nonhuman animals cannot process role-governed rules, relational schemas, and so on, in a human-like fashion. However, actual human performance is often more similar to that of nonhuman animals than Penn et al. admit. The kind of rule-governed performance the authors take for granted may rely to a substantial degree on language on external symbol systems such as those provided by language and culture.

scholarly journals Validation of schema mappings with nested queries

2013 ◽  
Vol 10 (1) ◽  
pp. 79-104
Author(s):  
Guillem Rull ◽  
Carles Farré ◽  
Ernest Teniente ◽  
Toni Urpí
Keyword(s):  
Integrity Constraints ◽  
Automatic Process ◽  
Document Type ◽  
Relational Schemas ◽  
Schema Mappings ◽  
Nested Data ◽  
Nested Queries ◽  
The Given ◽  
Human Designer ◽  
The Web

With the emergence of the Web and the wide use of XML for representing data, the ability to map not only flat relational but also nested data has become crucial. The design of schema mappings is a semi-automatic process. A human designer is needed to guide the process, choose among mapping candidates, and successively refine the mapping. The designer needs a way to figure out whether the mapping is what was intended. Our approach to mapping validation allows the designer to check whether the mapping satisfies certain desirable properties. In this paper, we focus on the validation of mappings between nested relational schemas, in which the mapping assertions are either inclusions or equalities of nested queries. We focus on the nested relational setting since most XML?s Document Type Definitions (DTDs) can be represented in this model. We perform the validation by reasoning on the schemas and mapping definition. We take into account the integrity constraints defined on both the source and target schema. We consider constraints and mapping?s queries which may contain arithmetic comparisons and negations. This class of mapping scenarios is significantly more expressive than the ones addressed by previous work on nested relational mapping validation. We encode the given mapping scenario into a single flat database schema, so we can take advantage of our previous work on validating flat relational mappings, and reformulate each desirable property check as a query satisfiability problem.

Induction of Relational Schemas: Common Processes in Reasoning and Complex Learning

1998 ◽  
Vol 35 (3) ◽  
pp. 201-245 ◽  
Author(s):  
Graeme S. Halford ◽  
John D. Bain ◽  
Murray T. Maybery ◽  
Glenda Andrews
Keyword(s):  
Complex Learning ◽  
Relational Schemas

Mapping Class Diagrams to Relational Schemas

2011 ◽  
pp. 103-123
Author(s):  
Peretz Shoval
Keyword(s):  
Mapping Class ◽  
Class Diagram ◽  
Relational Schema ◽  
Relational Schemas ◽  
Mapping Rules ◽  
Mapping Process ◽  
Class Diagrams

This chapter first explains the need to map a class diagram to a relational schema. Then, most of the chapter is dedicated to presenting and demonstrating the mapping rules based on which a relational schema (made of normalized relations) is created. The mapping process is demonstrated with several comprehensive examples.

An Evaluation of Dynamic Electronic Catalog Models in Relational Database Systems

2011 ◽  
pp. 73-90 ◽  
Author(s):  
Kiryoong Kim ◽  
Dongkyu Kim ◽  
Jeuk Kim ◽  
Sang-uk Park ◽  
Ighoon Lee ◽  
...  
Keyword(s):  
Electronic Commerce ◽  
Relational Database ◽  
Relational Databases ◽  
Database Systems ◽  
Relational Schemas ◽  
Electronic Catalogs ◽  
Electronic Catalog ◽  
Software Product ◽  
New Models ◽  
Relational Database Systems

Electronic catalogs are electronic representations about products and services in the electronic commerce environment and require diverse and flexible schemas. Although relational database systems seem to be an obvious choice for their storage, traditional designs of relational schemas do not support electronic catalogs in the most effective ways. Therefore, new models for managing diverse and flexible schemas in relational databases are required for such systems. Proposed in this paper are several models for electronic catalogs using relational tables, and an experimental evaluation of their efficiency. The results of this study can be put to practical use and are, in fact, being applied in the design of a commercial software product.

Maintaining Mappings between Conceptual Models and Relational Schemas

2010 ◽  
Vol 21 (3) ◽  
pp. 36-68 ◽  
Author(s):  
Yuan An ◽  
Xiaohua Hu ◽  
Il-Yeol Song
Keyword(s):  
Conceptual Model ◽  
Design Process ◽  
Information Needs ◽  
Conceptual Models ◽  
Database Design ◽  
Round Trip ◽  
Relational Schemas ◽  
Engineering Approach ◽  
New Information ◽  
Relational Mapping

This paper describes a round-trip engineering approach for incrementally maintaining mappings between conceptual models and relational schemas. When either schema or conceptual model evolves to accommodate new information needs, the existing mapping must be maintained accordingly to continuously provide valid services. In this paper, the authors examine the mappings specifying “consistent” relationships between models. First, they define the consistency of a conceptual-relational mapping through “semantically compatible” instances. Next, the authors analyze the knowledge encoded in the standard database design process and develop round-trip algorithms for incrementally maintaining the consistency of conceptual-relational mappings under evolution. Finally, they conduct a set of comprehensive experiments. The results show that the proposed solution is efficient and provides significant benefits in comparison to the mapping reconstructing approach.

From relational schemas to subject-specific semantic relations

2004 ◽  
Vol 2 ◽  
pp. 235-259
Author(s):  
Ulrike Oster
Keyword(s):  
Word Formation ◽  
Semantic Relations ◽  
Compound Words ◽  
Complex Issue ◽  
Relational Schemas ◽  
Subject Specific

Compounding is a major word-formation procedure in many languages, and even more so in specialised terminology. The classification of these compound words is a very complex issue due to the large number of semantic relations that can hold between the constituents of the compound. Typologies for different special languages differ considerably from each other and usually combine rather general with highly subject-specific relations. This paper presents a proposal for a two-step classification of these intraterm relations. First, a set of basic relational schemas is worked out, whose purpose is to serve as a tool for the interpretation of semantic relations. These schemas, which are potentially applicable to any domain, are then used to classify the actual compound terms that appear in a corpus of texts from a specific technical field.

Sign in / Sign up

Export Citation Format

Share Document