(Enter summary)
Abstract: 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... (Update)
Cited by: More
On the Power of Incremental Evaluation in SQL-like Languages - Libkin, Wong (1999)
(Correct)
Incremental Recomputation in Local Languages - Dong, Libkin, Wong (2003)
(Correct)
Locally Consistent Transformations and Query Answering in - Data Exchange Marcelo
(Correct)
Similar documents (at the sentence level):
51.1%: Logics with Aggregate Operators - Hella, Libkin, Nurmonen, Wong
(Correct)
Active bibliography (related documents): More All
0.5: On Counting Logics and Local Properties - Libkin (1998)
(Correct)
0.5: Logics with Counting and Local Properties - Libkin (2000)
(Correct)
0.4: Counting and Locality over Finite Structures: a Survey - Libkin, Nurmonen (1999)
(Correct)
Similar documents based on text: More All
0.7: Emerging Patterns and Gene Expression Data - Li, Wong
(Correct)
Related documents from co-citation: More All
23: On local and non-local properties (context) - Gaifman - 1982
20: Notions of locality and their logical characterizations over finite models
- Hella, Libkin et al. - 1997
19: On monadic NP vs monadic co-NP (context) - Fagin, Stockmeyer et al. - 1994
BibTeX entry: (Update)
L. Hella, L. Libkin, J. Nurmonen and L. Wong. Logics with aggregate operators. In LICS'99, to appear. http://citeseer.ist.psu.edu/article/hella99logic.html More
@inproceedings{ hella99logics,
author = "Lauri Hella and Leonid Libkin and Juha Nurmonen and Limsoon Wong",
title = "Logics with aggregate operators",
booktitle = "Proc. of the 14th Symp. on Logic in Computer Science ({LICS})",
publisher = "IEEE Press",
address = "Trento, Italy",
pages = "35--44",
year = "1999",
url = "citeseer.ist.psu.edu/article/hella99logic.html" }
Citations (may not include all citations):
981
Principles of Database and Knowledge-Base Systems (context) - Ullman - 1988
775
Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
379
The complexity of relational query languages (context) - Vardi - 1982
294
Finite Model Theory (context) - Ebbinghaus, Flum - 1995
245
Relational queries computable in polynomial time
- Immerman - 1986
211
Languages that capture complexity classes
- Immerman - 1987
116
On uniformity within NC
- Barrington, Immerman et al. - 1990
116
On local and non-local properties (context) - Gaifman - 1982
110
Descriptive Complexity (context) - Immerman - 1999
106
Equivalence of relational algebra and relational calculus qu.. (context) - Klug - 1982
93
Principles of programming with complex objects and collectio..
- Buneman, Naqvi et al. - 1995
66
Describing graphs: A first order approach to graph canonizat..
- Immerman, Lander - 1990
61
Monotonic aggregation in deductive databases
- Ross, Sagiv - 1992
60
Normal forms and conservative properties for query languages..
- Wong - 1996
54
and logarithmic space (context) - Etessami, successor - 1997
54
Low complexity aggregation in GraphLog and Datalog
- Consens, Mendelzon - 1993
50
Magic of duplicates and aggregates
- Mumick, Pirahesh et al. - 1990
49
Query languages for bags and aggregate functions
- Libkin, Wong - 1997
49
Local properties of query languages
- Dong, Libkin et al.
49
Model-theoretic methods in the study of elementary logic (context) - Hanf - 1965
49
On monadic NP vs monadic co-NP (context) - Fagin, Stockmeyer et al. - 1995
49
Towards an effective calculus for object query languages
- Fegaras, Maier
48
Rewriting aggregate queries using views
- Cohen, Nutt et al. - 1999
44
Information and Computation (context) - Hella, in - 1996
43
Computing with first-order logic
- Abiteboul, Vianu - 1995
41
Foundations of aggregation constraints
- Ross, Srivastava et al. - 1998
39
Information and Computation (context) - Gradel, Gurevich et al. - 1998
36
Generalized quantifiers and pebble games on finite structure.. (context) - Kolaitis, Vaananen - 1995
33
Information and Computation (context) - Kolaitis, Vardi et al. - 1992
31
Notions of locality and their logical characterizations over..
- Hella, Libkin et al. - 1999
29
On winning strategies with unary quantifiers
- Nurmonen - 1996
28
The well-founded semantics of aggregation (context) - Van Gelder - 1992
27
the forms of locality over finite models
- Libkin - 1996
26
Querying aggregate data
- Grumbach, Rafanelli et al. - 1999
22
Bounded Variable Logics and Counting: A Study in Finite Mode.. (context) - Otto - 1997
19
Circuit complexity before the dawn of the new millennium
- Allender - 1996
17
the power of aggregation in relational query languages
- Libkin, Wong - 1997
12
Logics with counting and local properties
- Libkin - 2000
12
How expressive is stratified aggregation
- Mumick, Shmueli - 1995
11
A calculus for collections and aggregates (context) - Lellahi, Tannen - 1997
8
First order logic (context) - Dawar, Lindell et al. - 1995
3
A framework for the investigation of aggregate functions in ..
- Cabibbo, Torlone - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://sdmc.krdl.org.sg:8080/~limsoon/limsoonpapers.html): More
Polymorphic Queries Across Sets, Bags, and Lists - Wong (1994)
(Correct)
Lower Bounds for Invariant Queries in Logics with Counting - Libkin, Wong (2002)
(Correct)
Comprehension Syntax - Buneman, Libkin, Suciu, Tannen, Wong (1994)
(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