Distributional–relational database

From Wikipedia, the free encyclopedia

A distributional–relational database, or word-vector database, is a database management system (DBMS) that uses distributional word-vector representations to enrich the semantics of structured data.

As distributional word-vectors can be built automatically from large-scale corpora,[1] this enrichment supports the construction of databases which can embed large-scale commonsense background knowledge into their operations. Distributional-Relational models can be applied to the construction of schema-agnostic databases (databases in which users can query the data without being aware of its schema), semantic search, schema-integration and inductive and abductive reasoning as well as different applications in which a semantically flexible knowledge representation model is needed. The main advantage of distributional–relational models over purely logical / semantic web models is the fact that the core semantic associations can be automatically captured from corpora, in contrast to the definition of manually curated ontologies and rule knowledge bases.[2]

Distributional–relational models[edit]

Distributional–relational models were first formalized,[3][4] as a mechanism to cope with the vocabulary/semantic gap between users and the schema behind the data. In this scenario, distributional semantic relatedness measures, combined with semantic pivoting heuristics can support the approximation between user queries (expressed in their own vocabulary), and data (expressed in the vocabulary of the designer).

In this model, the database symbols (entities and relations) are embedded into a distributional semantic space and have a geometric interpretation under a latent or explicit semantic space. The geometric aspect supports the semantic approximation between entities from different databases, or between a query term and a database entity. The distributional relational model then becomes a double layered model where the semantics of the structured data provides the fine-grained semantics intended by the database designer, which is extended by the distributional semantic model which contains the semantic associations expressed at a broader use. These models support the generalization from a closed communication scenario (in which database designers and users live in the same context, e.g. the same organization) to an open communication scenario (e.g. different organizations, the Web), creating an abstraction layer between users and the specific representation of the conceptual model.

References[edit]

  1. ^ Harris, Z. (1954). "Distributional structure". Word. 10 (23): 146–162.
  2. ^ Métais, Elisabeth; Roche, Mathieu; Teisseire, Maguelonne (2014-06-16). Natural Language Processing and Information Systems: 19th International Conference on Applications of Natural Language to Information Systems, NLDB 2014, Montpellier, France, June 18-20, 2014. Proceedings. Springer. ISBN 978-3-319-07983-7.
  3. ^ Freitas, A. “Schema-agnostic queries over large-schema databases: a distributional semantics approach” PhD Thesis, 2015
  4. ^ Freitas, A., Handschuh, S., Curry, E., Distributional-Relational Models: Scalable Semantics for Databases, AAAI Spring Symposium, Knowledge Representation & Reasoning Track, Stanford, 2014