String operations in query languages

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2001, Pages 183-194

  Benedikt, M ^a   Libkin, L ^a   Schwentick, T ^a   Segoufin, L ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; PATTERN MATCHING; RELATIONAL DATABASE SYSTEMS;

STRING OPERATIONS;

QUERY LANGUAGES;

EID: 0034819661     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/375551.375578     Document Type: Conference Paper

References (28)

1. The closure of monadic NP
2. First-order logic vs. fixed-point logic in finite set theory
3. 1
4. Extended order-generic queries
5. Relational queries over interpreted structures
6. Safe constraint queries
7. Automatic structures
8. Sequences, datalog, and transducers
9. Querying string databases with transducers
10. Logic and p-recognizable sets of integers
11. Algebras for querying text regions: Expressive power and optimization
12. Expressive power and data complexity of query languages for trees and lists
13. Pattern matching by rs-operations: Toward a unified approach to querying sequenced data
14. Safety, translation and evaluation of alignment calculus
15. Reasoning about strings in databases
16. How to make SQL stand for string query language
17. Implementing a declarative string query language with string restructuring
18. A technique for proving decidability of containment and equivalence of linear constraint queries
19. Fixpoint logic vs. infinitary logic in finite-model theory
20. String-oriented databases
21. Finite queries do not have effective syntax