Type inference for datalog with complex type hierarchies

Abstract

What is disclosed are a novel system and method for inferring types of database queries. In one embodiment a program and associated database schema that includes a type hierarchy is accessed. The program includes query operations to a database that contains relations described by a database schema. Types are inferred from definitions in the program by replacing each database relationship in the program by the types in the database schema. A new program is generated with the types that have been inferred with the new program only accessing unary relations in the database. In another embodiment, testing of each of the types that have been inferred is performed for type emptiness. In response to type emptiness being found for a type that have been inferred, a variety of different operations are performing including removing the type, providing a notification regarding the emptiness found for the type, and more.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS[0001]This applicationThe present application is a reissue application of U.S. application Ser. No. 13 / 183,514, which was filed on Jul. 15, 2011 and issued as U.S. Pat. No. 8,595,213 on Nov. 26, 2013 which is based upon and claims priority from prior provisional patent application No. 61 / 364,571, filed on Jul. 15, 2010 the entire disclosure of which is herein incorporated by reference.FIELD OF THE INVENTION[0002]The present invention relates generally to information retrieval, in particular the way electronically stored data is accessed via queries that are formulated in a programming language. The invention concerns both the detection of errors in such queries, and their efficient execution.BACKGROUND OF THE INVENTION[0003]Like any other programming task, writing queries is error-prone, and it is helpful if the programming language in which queries are expressed gives assistance in identifying errors while queries are being written, and before...

AI Technical Summary

Benefits of technology

The present invention is a system and method for computing types for queries that accurately approximate the actual set of results, taking into account the type hierarchy on data stored in a database. This is different from previous attempts that only caught errors after the query was executed on the database. The invention uses a programming language, such as SQL, that assigns types to each variable separately, making it difficult to identify errors. The invention infers precise types for queries that have complex conditions involving subtyping and disjointness. Overall, the invention improves the accuracy of detecting and addressing programming errors in querying.

Problems solved by technology

The only kind of error found is when an operation does not make sense: for instance, a string cannot be subtracted from an integer.

In particular one cannot predict accurately (without running the query), whether a query will return any results or not.

And yet, a query that returns no results is the most common symptom of a programming error.

None of these attempts precisely tracks the dependencies between variables, however, and therefore they are suboptimal: there are many queries for which one could prove that no results are returned, and yet the type checkers do not find the errors.

It is very confusing for users that some errors of this kind are caught, and others are not.

Furthermore these works do not take advantage of the type hierarchies that typically exist on data stored in a database.

Images