Results 1  10
of
65
A Foundation for MultiDimensional Databases
, 1997
"... gyssensQcharlie.luc.ac.be laksQcs.concordia.ca We present a multidimensional database model, which we believe can serve as a conceptual model for OnLine Analytical Processing (OLAP)based applications. Apart from providing the functionalities necessary for OLAPbased applications, the main feat ..."
Abstract

Cited by 90 (0 self)
 Add to MetaCart
gyssensQcharlie.luc.ac.be laksQcs.concordia.ca We present a multidimensional database model, which we believe can serve as a conceptual model for OnLine Analytical Processing (OLAP)based applications. Apart from providing the functionalities necessary for OLAPbased applications, the main feature of the model we propose is a clear separation between structural aspects and the contents. This separation of concerns allows us to define data manipulation languages in a reasonably simple, transparent way. In particular, we show that the data cube operator can be expressed easily. Concretely, we define an algebra and a calculus and show them to be equivalent. We conclude by comparing our approach to related work. The conceptual multidimensional database model developed here is orthogonal to its implementation, which is not a subject of the present paper. 1
Finite state machines for strings over infinite alphabets
 ACM TRANS. COMPUT. LOG
, 2004
"... Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite alphabets. These are conservative extensions of classical automata and logics defining the regular languages on finite alphabets. Specifically, we consider register and pebble au ..."
Abstract

Cited by 62 (15 self)
 Add to MetaCart
Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite alphabets. These are conservative extensions of classical automata and logics defining the regular languages on finite alphabets. Specifically, we consider register and pebble automata, and extensions of firstorder logic and monadic secondorder logic. For each type of automaton we consider oneway and twoway variants, as well as deterministic, nondeterministic, and alternating control. We investigate the expressiveness and complexity of the automata, their connection to the logics, as well as standard decision problems. Some of our results answer open questions of Kaminski and Francez on register automata.
On the fixed parameter complexity of graph enumeration problems definable in monadic secondorder logic
, 2001
"... ..."
Abstract state machines capture parallel algorithms
 ACM Transactions on Computational Logic
, 2003
"... Abstract We give an axiomatic description of parallel, synchronous algorithms. Our main result is that every such algorithm can be simulated, step for step, by an abstract state machine with a background that provides for multisets. \Lambda ..."
Abstract

Cited by 58 (23 self)
 Add to MetaCart
Abstract We give an axiomatic description of parallel, synchronous algorithms. Our main result is that every such algorithm can be simulated, step for step, by an abstract state machine with a background that provides for multisets. \Lambda
Finitely Representable Databases
, 1995
"... : We study classes of infinite but finitely representable databases based on constraints, motivated by new database applications such as geographical databases. We formally define these notions and introduce the concept of query which generalizes queries over classical relational databases. We prove ..."
Abstract

Cited by 55 (8 self)
 Add to MetaCart
: We study classes of infinite but finitely representable databases based on constraints, motivated by new database applications such as geographical databases. We formally define these notions and introduce the concept of query which generalizes queries over classical relational databases. We prove that in this context the basic properties of queries (satisfiability, containment, equivalence, etc.) are nonrecursive. We investigate the theory of finitely representable models and prove that it differs strongly from both classical model theory and finite model theory. In particular, we show that most of the well known theorems of either one fail (compactness, completeness, locality, 0/1 laws, etc.). An immediate consequence is the lack of tools to consider the definability of queries in the relational calculus over finitely representable databases. We illustrate this very challenging problem through some classical examples. We then mainly concentrate on dense order databases, and exhibit...
L.: Locally consistent transformations and query answering in data exchange
 In: Proceedings PODS’04
, 2004
"... Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions – target instances that satisfy the constraints of the data exchange problem. Previous work has identified two classes of des ..."
Abstract

Cited by 48 (17 self)
 Add to MetaCart
Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions – target instances that satisfy the constraints of the data exchange problem. Previous work has identified two classes of desirable solutions: canonical universal solutions, and their cores. Query answering in data exchange amounts to rewriting a query over the target schema to another query that, over a materialized target instance, gives the result that is semantically consistent with the source. A basic question is then whether there exists a transformation sending a source instance into a solution over which target queries can be answered. We show that the answer is negative for many data exchange transformations that have structural properties similar to canonical universal solutions and cores. Namely, we prove that many such transformations preserve the local structure of the data. Using this notion, we further show that every target query rewritable over such a transformation cannot distinguish tuples whose neighborhoods in the source are similar. This gives us a first tool that helps check whether a query is rewritable. We also show that these results are robust: they hold for an extension of relational calculus with grouping and aggregates, and for two different semantics of query answering. 1.
Finite Presentations of Infinite Structures: Automata and Interpretations
 Theory of Computing Systems
, 2002
"... We study definability problems and algorithmic issues for infinite structures that are finitely presented. After a brief overview over different classes of finitely presentable structures, we focus on structures presented by automata or by modeltheoretic interpretations. ..."
Abstract

Cited by 41 (3 self)
 Add to MetaCart
We study definability problems and algorithmic issues for infinite structures that are finitely presented. After a brief overview over different classes of finitely presentable structures, we focus on structures presented by automata or by modeltheoretic interpretations.
Queries with Arithmetical Constraints
 Theoretical Computer Science
, 1997
"... In this paper, we study the expressive power and the complexity of firstorder logic with arithmetic, as a query language over relational and constraint databases. We consider constraints over various domains (N, Z, Q, and R), and with various arithmetical operations (6, +, \Theta, etc.). We first c ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
In this paper, we study the expressive power and the complexity of firstorder logic with arithmetic, as a query language over relational and constraint databases. We consider constraints over various domains (N, Z, Q, and R), and with various arithmetical operations (6, +, \Theta, etc.). We first consider the data complexity of firstorder queries. We prove in particular that linear queries can be evaluated in AC 0 over finite integer databases, and in NC 1 over linear constraint databases. This improves previously known bounds. We also show that over all domains, enough arithmetic lead to arithmetical queries, therefore, showing the frontiers of constraints for database purposes. We then tackle the problem of the expressive power, with the definability of the parity and the connectivity, which are the most classical examples of queries not expressible in firstorder logic over finite structures. We prove that these two queries are firstorder definable in presence of (enough) ari...
Towards Regular Languages Over Infinite Alphabets
, 2001
"... Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite alphabets. These are conservative extensions of classical automata and logics defining the regular languages on finite alphabets. Specically, we consider register and pebble auto ..."
Abstract

Cited by 24 (4 self)
 Add to MetaCart
Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite alphabets. These are conservative extensions of classical automata and logics defining the regular languages on finite alphabets. Specically, we consider register and pebble automata, and extensions of firstorder logic and monadic secondorder logic. For each type of automaton we consider oneway and twoway variants, as well as deterministic, nondeterministic, and alternating control. We investigate the expressiveness and complexity of the automata, their connection to the logics, as well as standard decision problems. Some of our results answer open questions of Kaminski and Francez on register automata.
Logics with Aggregate Operators
 Journal of the ACM
"... We study adding aggregate operators, such as summing up elements of a column of a relation, to logics with counting mechanisms. The primary motivation comes from database applications, where aggregate operators are present in all real life query languages. Unlike other features of query languages, a ..."
Abstract

Cited by 24 (12 self)
 Add to MetaCart
We study adding aggregate operators, such as summing up elements of a column of a relation, to logics with counting mechanisms. The primary motivation comes from database applications, where aggregate operators are present in all real life query languages. Unlike other features of query languages, aggregates are not adequately captured by the existing logical formalisms. Consequently, all previous approaches to analyzing the expressive power of aggregation were only capable of producing partial results, depending on the allowed class of aggregate and arithmetic operations. We consider a powerful counting logic, and extend it with the set of all aggregate operators. We show that the resulting logic satis es analogs of Hanf's and Gaifman's theorems, meaning that it can only express local properties. We consider a database query language that expresses all the standard aggregates found in commercial query languages, and show how it can be translated into the aggregate logic, thereby pro...