Inderpal Singh Mumick, Oded Shmueli  Home/Search
Context
Related
| savera.com/mumick/...bAggexp950131.ps.Z belllabs.com/home...bAggexp950131.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: savera.com/mumick/papers/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We present results on the expressive power of various deductive database languages extended with stratified aggregation. We show that (1) Datalog extended with stratified aggregation cannot express a query to count the number of paths between every pair of nodes in an acyclic graph, (2) Datalog extended with stratified aggregation and arithmetic on integers (the + operator) can express all computable queries on ordered domains, and (3) Datalog extended with stratified aggregation and generic... (Update)
Active bibliography (related documents): More All
0.3: Adornments in Database Programs - Mumick, Pirahesh, Ramakrishnan (1993) (Correct)
0.3: Finiteness Properties of Database Queries - Mumick, Shmueli (1993) (Correct)
0.1: Complexity of Nonrecursive Logic Programs with Complex Values - Vorobyov, Voronkov (1998) (Correct)
Similar documents based on text: More All
0.4: Magic Conditions - Mumick, Finkelstein, Pirahesh.. (1990) (Correct)
0.3: Universal Finiteness and Satisfiability - Mumick, Shmueli (1994) (Correct)
0.3: Temporal Queries for Active Database Support - Gehani, Jagadish, Mumick, al. (1993) (Correct)
BibTeX entry: (Update)
@article{ mumick95how,
author = "Inderpal Singh Mumick and Oded Shmueli",
title = "How Expressive is Statified Aggregation?",
journal = "Annals of Mathematics and Artificial Intelligence",
volume = "15",
number = "3-4",
pages = "407-434",
year = "1995",
url = "citeseer.ist.psu.edu/mumick95how.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1838 Foundations of Logic Programming (context) - Lloyd - 1984
981 Principles of Database and Knowledge-Base Systems (context) - Ullman - 1988
189 Computable queries for relational data bases - Chandra, Harel - 1980
114 Generic computation and its complexity (context) - Abiteboul, Vianu - 1991
61 The expressive powers of the logic programming semantics (context) - Schlipf - 1990
61 Monotonic aggregation in deductive databases - Ross, Sagiv - 1992
54 Low complexity aggregation in Graphlog and Datalog - Consens, Mendelzon - 1990
50 The magic of duplicates and aggregates - Mumick, Pirahesh et al. - 1990
40 Implementation of logical query languages for databases (context) - Ullman - 1985
40 Semantics of logic programs with aggregates - Kemp, Stuckey - 1991
33 Minimum and maximum predicates in logic programming - Ganguly, Greco et al. - 1991
31 Non-determinism in deductive databases - Giannotti, Pedreschi et al. - 1991
28 Non-deterministic choice in datalog (context) - Krishnamurthy, Naqvi - 1988
18 and computable queries (context) - Hull, Su et al. - 1989
17 Horn clause computability (context) - Tarnlund - 1977
14 Arithmetic classification of perfect models of stratified pr.. (context) - Apt, Blair - 1988
14 Extending the well-founded and valid semantics for aggregati.. - Sudarshan, Srivastava et al. - 1992
3 Technical Report No (context) - Mumick, in et al. - 1991
1 Personal communications on summarized explosion query (context) - Mumick, Ullman et al. - 1989
Documents on the same site (http://www.savera.com/mumick/papers/index.html): More
Adornments in Database Programs - Mumick, Pirahesh, Ramakrishnan (Correct)
SUNRISE II: A Scalable and Timely Billing Architecture - Jagadish, Mumick (1997) (Correct)
Algorithms for Deferred View Maintenance - Colby, Griffin, Libkin, Mumick.. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC