Complexity Bounds for Relational Algebra over Document Spanners.
Liat PeterfreundDominik D. FreydenbergerBenny KimelfeldMarkus KröllPublished in: CoRR (2019)
Keyphrases
- relational algebra
- complexity bounds
- relational model
- expressive power
- data model
- query language
- normal form
- relational database systems
- relational calculus
- complex objects
- first order logic
- worst case
- transitive closure
- relational databases
- constraint networks
- database
- keywords
- query containment
- database technology
- query answering
- incomplete information
- user queries
- data integration
- upper bound