A data base system that supports natural language queries is not really natural if it requires the user to know how the data are represented. This paper defines a formalism, called conceptual graphs, that can describe data according to the user’s view and access data according to the system’s view. In addition, the graphs can represent functional dependencies in the data base and support infere...

We present an alternative approach to that of Chandra and Harel [CHAN80] and Abiteboul and Vianu [ABIT90] in considering computable database queries, which are mappings from sets of records to sets of records. In particular, we view a computable database query as being realised via a Turing-computable mapping from strings to strings and an encoding, which encodes the input set of records into a...

Large linked data repositories have been built by leveraging semi-structured data in Wikipedia (e.g., DBpedia) and through extracting information from natural language text (e.g., YAGO). However, the Web contains many other vast sources of linked data, such as structured HTML tables and spreadsheets. Often, the semantics in such tables is hidden, preventing one from extracting triples from them...

This paper analyzes the relationship between initialization error and recall of a specific memory in the Grover algorithm for quantum database search. It is shown that the correct memory is obtained with high probability even when the initial state is far removed from the correct one. The analysis is done by relating the variance of error in the initial state to the recovery of the correct memo...

Nutionul Westministcr still runs major core processes that were written in the early 19GOs. These and the systems that followed it were written using ttwls and techniques available at the appropriate time. Little structure or consistency of approach is apparent in the earlier systems, and in most cases little cohesion exists between systems supporting different areas of business. The organic gr...

publication unless accompanied by a request to the con trary. Technical papers are unrefereed. a participating member of the IC is entitled to receive the quarterly bulletin of the TO free of charge, until further notice. tems have contributed short papers that describe their current and future research efforts.

In this paper we will present the two basic operations for database schemas used in database mapping systems (separation and Data Federation), and we will explain why the functorial semantics for database mappings needed a new base category instead of usual Set category. Successively, it is presented a definition of the graph G for a schema database mapping system, and the definition of its ske...

St!!!SAME is being developed to provide an easy access to the content of relational data bases to users without a specific computer training. Queries me typed in natural language either freely or with a guided mode. The system dynamically proposes through menus the different words and phrases that c;~n make up a query. Users are able to exploit the results of their queries with standard electro...

Base transceiver systems transfer large amounts of sampled baseband signals over serial data links between base station processors and RF modules. To comply with evolving wireless communication standards, greater data rates on these serial links are needed. However, increasing the actual bit rate on the links or increasing the number of physical links is in conflict with the existing base trans...

Extensibility is one of many claims of improved performance being made for distributed processing systems. Extensibility means system properties, such as "incremental growth and configuration flexibility," "highly adaptable to changes in workload," "incremental replacement and/or upgrading of components (both hardware and software)" and "easily expanded in both capacity and function."2 Although...