Interactive Query Formulation using Point to Point Queries

02/02/2021
by   Henderik Alex Proper, et al.
0

Effective information disclosure in the context of databases with a large conceptual schema is known to be a non-trivial problem. In particular the formulation of ad-hoc queries is a major problem in such contexts. Existing approaches for tackling this problem include graphical query interfaces, query by navigation, and query by construction. In this article we propose the point to point query mechanism that can be combined with the existing mechanism into an unprecedented computer supported query formulation mechanism. In a point to point query a path through the information structure is build. This path can then be used to formulate more complex queries. A point to point query is typically useful when users know some object types which are relevant for their information need, but do not (yet) know how they are related in the conceptual schema. Part of the point to point query mechanism is therefore the selection of the most appropriate path between object types (points) in the conceptual schema. This article both discusses some of the pragmatic issues involved in the point to point query mechanism, and the theoretical issues involved in finding the relevant paths between selected object types.

READ FULL TEXT

page 5

page 6

page 7

page 8

page 24

page 25

page 26

page 27

research
05/20/2021

Interactive Query Formulation using Spider Queries

Effective information disclosure in the context of databases with a larg...
research
05/20/2021

Generating Significant Examples for Conceptual Schema Validation

This report bases itself on the idea of using concrete examples to verif...
research
05/19/2021

An Overview of Computer Supported Query Formulation

Most present day organisations make use of some automated information sy...
research
05/20/2021

Interactive Query Formulation using Query By Navigation

Effective information disclosure in the context of databases with a larg...
research
01/19/2018

PRESTO: Probabilistic Cardinality Estimation for RDF Queries Based on Subgraph Overlapping

In query optimisation accurate cardinality estimation is essential for f...
research
10/10/2019

Efficient Path Routing Over Road Networks in the Presence of Ad-Hoc Obstacles (Technical Report)

Nowadays, the path routing over road networks has become increasingly im...
research
10/02/2018

Heterogeneous Replica for Query on Cassandra

Cassandra is a popular structured storage system with high-performance, ...

Please sign up or login with your details

Forgot password? Click here to reset