Fdb: A query engine for factorised relational databases

Proceedings of the VLDB Endowment

Volumn 5, Issue 11, 2012, Pages 1232-1243

  Bakibayev, Nurzhan ^a   Olteanu, Dan ^a   Závodný, Jakub ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK LAYERS;

DATA REDUNDANCY; NOVEL ALGORITHM; ORDERS OF MAGNITUDE; PHYSICAL LAYERS; QUERY ENGINES; QUERY PERFORMANCE; RELATIONAL DATABASE; SELECT-PROJECT-JOIN QUERIES;

ENGINES;

EID: 84873151303     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2350229.2350242     Document Type: Article

References (21)

1. S. Abiteboul and N. Bidoit. Non first normal form relations: An algebra allowing data restructuring. JCSS, 33(3):361-393, 1986.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
3. S. Agrawal, V. Narasayya, and B. Yang. Integrating vertical and horizontal partitioning into automated physical database design. In SIGMOD, pages 359-370, 2004.
4. L. Antova, C. Koch, and D. Olteanu. 10106 Worlds and Beyond: Efficient Representation and Processing of Incomplete Information. In ICDE, pages 606-615, 2007.
5. M. Aschinger, C. Drescher, G. Gottlob, P. Jeavons, and E. Thorstensen. Tackling the partner units configuration problem. In IJCAI, pages 497-503, 2011.
6. G. Bagan, A. Durand, and E. Grandjean. On acyclic conjunctive queries and constant delay enumeration. In CSL, pages 208-222, 2007.
7. F. Bancilhon, P. Richard, and M. Scholl. On line processing of compacted relations. In VLDB, pages 263-269, 1982.
8. P. A. Boncz, S. Manegold, and M. L. Kersten. Database architecture optimized for the new bottleneck: Memory access. In VLDB, pages 54-65, 1999.
9. R. K. Brayton. Factoring logic functions. IBM J. Res. Develop., 31(2):187-198, 1987.
10. M. C. F. D. J. Abadi, S. R. Madden. Integrating compression and execution in column-oriented database systems. In SIGMOD, pages 671-682, 2006.
11. G. Gottlob. On minimal constraint networks. In CP, pages 325-339, 2011.
12. T. J. Green, G. Karvounarakis, and V. Tannen. Provenance semirings. In PODS, pages 31-40, 2007.
13. M. Grohe and D. Marx. Constraint solving via fractional edge covers. In SODA, pages 289-298, 2006.
14. M. Grund, J. Kr̈uger, H. Plattner, A. Zeier, P. Cudŕe-Mauroux, and S. Madden. HYRISE - A main memory hybrid storage engine. PVLDB, 4(2):105-116, 2010.
15. T. Imielinski, S. Naqvi, and K. Vadaparty. Incomplete objects - A data model for design and planning applications. In SIGMOD, pages 288-297, 1991.
16. D. Olteanu and J. Huang. Using OBDDs for efficient query evaluation on probabilistic databases. In SUM, pages 326-340, 2008.
17. D. Olteanu, C. Koch, and L. Antova. World-set decompositions: Expressiveness and efficient algorithms. TCS, 403(2-3):265-284, 2008.
18. D. Olteanu and J. Źavodńy. On factorisation of provenance polynomials. In TaPP, 2011.
19. D. Olteanu and J. Źavodńy. Factorised representations of query results: Size bounds and readability. In ICDT, pages 285-298, 2012.
20. M. P̈oss and D. Potapov. Data compression in Oracle. In VLDB, pages 937-947, 2003.
21. D. Suciu, D. Olteanu, C. Ŕe, and C. Koch. Probabilistic Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2011. 1243