A Query Language for List-Based Complex Objects
Summary: Introduces Lcp, a query language over tuple+finite-list "list-object" types that exactly captures polynomial-time generic functions on list-based complex objects. Key novelty: an iteration primitive driven by a second control list and a syntactic growth constraint allowing intermediates to be output or reinjected while ensuring PTIME (excludes finite-set/recursive types). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Latha S. Colby (Data Parallel Systems, Inc.)
- 2. Edward L. Robertson (Indiana University)
- 3. Lawrence V. Saxton (University of Regina)
- 4. Dirk Van Gucht (Indiana University)
BibTeX Citation
@inproceedings{colby_pods94,
address = {New York, NY, USA},
series = {{PODS} '94},
title = {{A Query Language for List-Based Complex Objects}},
url = {https://dl.acm.org/doi/10.1145/182591.182611},
doi = {10.1145/182591.182611},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Colby, Latha S. and Robertson, Edward L. and Saxton, Lawrence V. and Van Gucht, Dirk},
year = {1994}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,708 | Cut and Paste | 1997 | PODS | 8.2272626e-05 |
| 4,077 | Similarity-Based Queries | 1995 | PODS | 6.921027e-05 |
| 6,184 | Expressive power and data complexity of nonrecursive query languages for lists and trees (Extended Abstract) | 2000 | PODS | 5.9488379e-05 |
| 6,802 | Sequences, Datalog and Transducers | 1995 | PODS | 5.7686659e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,864 | The Expressiveness of a Family of Finite Set Languages | 1991 | PODS | 9.5928463e-05 |
| 1,909 | A Call to Order | 1993 | PODS | 9.4991504e-05 |
| 2,373 | Pattern Matching by Rs-Operations: Towards a Unified Approach to Querying Sequenced Data (Extended Abstract) | 1992 | PODS | 8.675907e-05 |
| 2,400 | Untyped Sets, Invention, and Computable Queries | 1989 | PODS | 8.6299917e-05 |
| 2,461 | Towards Tractable Algebras for Bags (Extended Abstract) | 1993 | PODS | 8.550394e-05 |
| 3,299 | SVP - a Model Capturing Sets, Streams, and Parallelism | 1992 | VLDB | 7.5418401e-05 |
| 3,564 | The Powerset Algebra As A Result Of Adding Programming Constructs To The Nested Relational Algebra | 1988 | SIGMOD | 7.3058238e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,523 | Dense-Order Constraint Databases (Extended Abstract) | 1995 | PODS |
| 2 | 13,097 | On the power of Rule-Based Languages with Sets | 1991 | PODS |
| 3 | 1,864 | The Expressiveness of a Family of Finite Set Languages | 1991 | PODS |
| 4 | 8,120 | Formal Semantics and Analysis of Object Queries | 2003 | SIGMOD |
| 5 | 4,702 | On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values | 2005 | PODS |
| 6 | 12,875 | Fixed-Point Query Languages for Linear Constraint Databases | 2000 | PODS |
| 7 | 13,040 | Investigation of Algebraic Query Optimisation for Database Programming Languages | 1994 | VLDB |
| 8 | 6,563 | Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (Extended Abstract) | 1994 | PODS |
| 9 | 6,184 | Expressive power and data complexity of nonrecursive query languages for lists and trees (Extended Abstract) | 2000 | PODS |
| 10 | 2,986 | Tractable Query Languages for Complex Object Databases | 1991 | PODS |