World-Set Decompositions: Expressiveness and Efficient Algorithms

Lyublena Antova, Christoph Koch, Dan Olteanu. World-Set Decompositions: Expressiveness and Efficient Algorithms. In Thomas Schwentick, Dan Suciu, editors, Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings. Volume 4353 of Lecture Notes in Computer Science, pages 194-208, Springer, 2007. [doi]

@inproceedings{AntovaKO07:0,
  title = {World-Set Decompositions: Expressiveness and Efficient Algorithms},
  author = {Lyublena Antova and Christoph Koch and Dan Olteanu},
  year = {2007},
  doi = {10.1007/11965893_14},
  url = {http://dx.doi.org/10.1007/11965893_14},
  researchr = {https://researchr.org/publication/AntovaKO07%3A0},
  cites = {0},
  citedby = {0},
  pages = {194-208},
  booktitle = {Database Theory - ICDT 2007, 11th International Conference, Barcelona, Spain, January 10-12, 2007, Proceedings},
  editor = {Thomas Schwentick and Dan Suciu},
  volume = {4353},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-69269-X},
}