Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

University of Nebraska - Lincoln

Constraint database

Publication Year

Articles 1 - 4 of 4

Full-Text Articles in Computer Engineering

A-Maze-D: Advanced Maze Development Kit Using Constraint Databases, Shruti Daggumarti, Peter Revesz, Corey Svehla Oct 2015

A-Maze-D: Advanced Maze Development Kit Using Constraint Databases, Shruti Daggumarti, Peter Revesz, Corey Svehla

CSE Conference and Workshop Papers

In this paper, we describe the A-Maze-D system which shows that constraint databases can be applied conveniently and efficiently to the design of maze games. A-Maze-D provides a versatile set of features by a combination of a MATLAB library and the MLPQ constraint database system. A-Maze-D is the first system that uses constraint databases to build maze games and opens new ideas in video game development.


Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet Sep 2009

Temporal Data Classification Using Linear Classifiers, Peter Revesz, Thomas Triplet

CSE Conference and Workshop Papers

Data classification is usually based on measurements recorded at the same time. This paper considers temporal data classification where the input is a temporal database that describes measurements over a period of time in history while the predicted class is expected to occur in the future. We describe a new temporal classification method that improves the accuracy of standard classification methods. The benefits of the method are tested on weather forecasting using the meteorological database from the Texas Commission on Environmental Quality.


Cxquery: A Novel Xml Query Language, Peter Revesz, Yi Chen Jan 2002

Cxquery: A Novel Xml Query Language, Peter Revesz, Yi Chen

CSE Conference and Workshop Papers

XML is becoming the data exchange standard on the Internet. Previously proposed XML query languages, such as XQuery, Quilt, YALT, Lorel, and XML-QL, lack schema definition of the query result; therefore, they are limited for defining views, integrating data, updating, and further querying, all of which are often needed in e-Business applications. We propose a novel XML query language called CXQuery, which defines the schema of the query results explicitly and can easily define views, and integrate, update, and query XML data. In addition, CXQuery can express spatial and spatio-temporal queries using a constraint-based querying approach.


Constraint Objects, Divesh Srivastava, Raghu Ramakrishnan, Peter Revesz May 1994

Constraint Objects, Divesh Srivastava, Raghu Ramakrishnan, Peter Revesz

CSE Conference and Workshop Papers

We describe the Constraint Object Data Model (CODM), which enhances an object-based data model with existential constraints to naturally represent partially specified information. We present the Constraint Object Query Language (COQL), a declarative, rule-based query language that can be used to infer relationships about and monotonically refine information represented in the CODM. COQL has a model-theoretic and an equivalent fixed-point semantics, based on the notions of constraint entailment and "proofs in all possible worlds." We also provide a novel polynomial-time algorithm for quantifier elimination for set-order constraints, a restricted class of set constraints that uses membership of subset-equal.