DBScholar

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
1234
Venue
PODS
Year
2001
Pagerank
5.093636e-05
Overall Rank
12,857 | 11.79%
DOI
10.1145/375551.375578

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{benedikt_pods01,
        address = {New York, NY, USA},
        series = {{PODS} '01},
        title = {{String Operations in Query Languages}},
        url = {https://dl.acm.org/doi/10.1145/375551.375578},
        doi = {10.1145/375551.375578},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Benedikt, Michael and Libkin, Leonid and Schwentick, Thomas and Segoufin, Luc},
        year = {2001}
}

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