Paper Info
Title
Typed functional query languages with equational specifications
Abstract
We present a framework for functionally modeling query languages and data models. Data and queries are uniformly represented by first-order functions, and query-language constructs by polymorphic higher-order functions. The functions are typed by a database-oriented type system that supports polymorphism and nesting of types, thus one can perform static type-checking and type-inferencing of query-expressions. The query language can be freely extended by introducing new querying constructs as polymorphic higher-order functions.While type information gives the input-output description of the functions, the semantic information is captured by equational specifications. Knowledge about the functions is represented as equalities of functional expressions in the form of equations. By equational axiomatization of the query language, database problems of query equivalence and answering-query with views can be posed as equational word-problems and equational matching.
Year
DOI
Venue
2005
10.1145/1099554.1099603
CIKM
Keywords
Field
DocType
query language,query equivalence,equational word-problems,typed functional query language,equational axiomatization,data model,equational specification,equational matching,database-oriented type system,functionally modeling query language,polymorphic higher-order function,higher order functions,type system,functional model,word problem,input output,olap,equational logic,polymorphism,first order
Query optimization,Data modeling,RDF query language,Query language,Programming language,Expression (mathematics),Computer science,Equivalence (measure theory),Equational logic,Online analytical processing
Conference
ISBN
Citations 
PageRank 
1-59593-140-6
0
0.34
References 
Authors
7
2
Name
Order
Citations
PageRank
Ken Q. Pu134928.16
Alberto O. Mendelzon248481394.98