Database Paper Browser

Back to papers

String Operations in Query Languages

Summary: Design compositional relational calculi for string ops that avoid concatenation’s computational completeness, preserving decidability and query safety. Base language: ordering+LIKE; length checks raise bounded complexity; trim/prefix and regex extensions still admit safe algebras and low evaluation complexity. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1235
Venue
PODS
Year
2001
Pagerank
4.1945683e-05
Overall Rank
12,664 | 11.90%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers