Digital Symposium Collection 2000  

 
 
 
 
 
 

 
















Michael Benedikt

Exact and Approximate Aggregation in Constraint Query

Publications

Note: Links lead to the DBLP on the Web.

Michael Benedikt

13 Michael Benedikt, Martin Grohe , Leonid Libkin , Luc Segoufin : Reachability and Connectivity Queries in Constraint Databases. PODS 2000 : 0-

12 Michael Benedikt, Thomas W. Reps , Shmuel Sagiv : A Decidable Logic for Describing Linked Data Structures. ESOP 1999 : 2-19

11 Michael Benedikt, Leonid Libkin : Exact and Approximate Aggregation in Constraint Query. PODS 1999 : 102-113

10 John T. Baldwin , Michael Benedikt: Embedded Finite Models, Stability Theory and the Impact of Order. LICS 1998 : 490-500

9 Michael Benedikt, Leonid Libkin : Safe Constraint Queries. PODS 1998 : 99-108

8 Michael Benedikt, Timothy Griffin , Leonid Libkin : Verifiable Properties of Database Transactions. Information and Computation 147 (1): 57-88 (1998)

7 Michael Benedikt, Guozhu Dong , Leonid Libkin , Limsoon Wong : Relational Expressive Power of Constraint Query Languages. JACM 45 (1): 1-34 (1998)

6 Michael Benedikt, H. Jerome Keisler : Expressive Power of Unary Counters. ICDT 1997 : 291-305

5 Michael Benedikt, Leonid Libkin : Languages for Relational Databases over Interpreted Structures. PODS 1997 : 87-98

4 Michael Benedikt, H. Jerome Keisler : Expressive Power of Unary Counters. Structures in Logic and Computer Science 1997 : 34-50

3 Michael Benedikt, Leonid Libkin : On the Structure of Queries in Constraint Query Languages. LICS 1996 : 25-34

2 Michael Benedikt, Timothy Griffin , Leonid Libkin : Verifiable Properties of Database Transactions. PODS 1996 : 117-127

1 Michael Benedikt, Guozhu Dong , Leonid Libkin , Limsoon Wong : Relational Expressive Power of Constraint Query Languages. PODS 1996 : 5-16



























Copyright(C) 2000 ACM