![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Dan Olteanu
Person information
- affiliation: University of Zurich, Switzerland
- affiliation (former): University of Oxford, UK
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j45]Ahmet Kara
, Dan Olteanu
, Dan Suciu
:
From Shapley Value to Model Counting and Back. Proc. ACM Manag. Data 2(2): 79 (2024) - [j44]Mahmoud Abo Khamis
, Vasileios Nakos
, Dan Olteanu
, Dan Suciu
:
Join Size Bounds using lp-Norms on Degree Sequences. Proc. ACM Manag. Data 2(2): 96 (2024) - [j43]Omer Abramovich
, Daniel Deutch
, Nave Frost
, Ahmet Kara
, Dan Olteanu
:
Banzhaf Values for Facts in Query Answering. Proc. ACM Manag. Data 2(3): 123 (2024) - [j42]Moe Kayali, Anton Lykov, Ilias Fountalis, Nikolaos Vasiloglou, Dan Olteanu, Dan Suciu:
CHORUS: Foundation Models for Unified Data Discovery and Exploration. Proc. VLDB Endow. 17(8): 2104-2114 (2024) - [j41]Dan Olteanu:
Technical Perspective: A Fresh Look at Stream Computation through DSP Glasses. SIGMOD Rec. 53(1): 86 (2024) - [j40]Ahmet Kara
, Milos Nikolic, Dan Olteanu
, Haozhe Zhang:
F-IVM: analytics over relational databases under updates. VLDB J. 33(4): 903-929 (2024) - [j39]Dan Olteanu
, Nils Vortmeier, Dorde Zivanovic:
Givens rotations for QR decomposition, SVD and PCA over database joins. VLDB J. 33(4): 1013-1037 (2024) - [c62]Dan Olteanu
:
Recent Increments in Incremental View Maintenance. PODS Companion 2024: 8-17 - [i44]Ahmet Kara
, Zheng Luo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Tractable Conjunctive Queries over Static and Dynamic Relations. CoRR abs/2404.16224 (2024) - [i43]Dan Olteanu:
Recent Increments in Incremental View Maintenance. CoRR abs/2404.17679 (2024) - 2023
- [j38]Ahmet Kara
, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries. Log. Methods Comput. Sci. 19(3) (2023) - [j37]Junxiong Wang, Immanuel Trummer
, Ahmet Kara
, Dan Olteanu:
ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Join Algorithms via Reinforcement Learning. Proc. VLDB Endow. 16(11): 2805-2817 (2023) - [j36]Junxiong Wang, Mitchell Gray, Immanuel Trummer, Ahmet Kara
, Dan Olteanu:
Demonstrating ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Joins via Reinforcement Learning. Proc. VLDB Endow. 16(12): 4094-4097 (2023) - [j35]Dan Olteanu:
Report on the Workshop on Factorized Databases. SIGMOD Rec. 52(2): 53-56 (2023) - [c61]Ahmet Kara
, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Evaluation Trade-Offs for Acyclic Conjunctive Queries. CSL 2023: 29:1-29:20 - [c60]Ahmet Kara
, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Conjunctive Queries with Free Access Patterns Under Updates. ICDT 2023: 17:1-17:20 - [i42]Ahmet Kara
, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
F-IVM: Analytics over Relational Databases under Updates. CoRR abs/2303.08583 (2023) - [i41]Moe Kayali, Anton Lykov, Ilias Fountalis, Nikolaos Vasiloglou, Dan Olteanu, Dan Suciu
:
CHORUS: Foundation Models for Unified Data Discovery and Exploration. CoRR abs/2306.09610 (2023) - [i40]Mahmoud Abo Khamis, Vasileios Nakos, Dan Olteanu, Dan Suciu:
Join Size Bounds using Lp-Norms on Degree Sequences. CoRR abs/2306.14075 (2023) - [i39]Ahmet Kara, Dan Olteanu, Dan Suciu:
From Shapley Value to Model Counting and Back. CoRR abs/2306.14211 (2023) - [i38]Junxiong Wang, Immanuel Trummer, Ahmet Kara
, Dan Olteanu:
ADOPT: Adaptively Optimizing Attribute Orders for Worst-Case Optimal Join Algorithms via Reinforcement Learning. CoRR abs/2307.16540 (2023) - [i37]Omer Abramovich, Daniel Deutch, Nave Frost, Ahmet Kara
, Dan Olteanu:
Banzhaf Values for Facts in Query Answering. CoRR abs/2308.05588 (2023) - [i36]Mahmoud Abo Khamis, Ahmet Kara
, Dan Olteanu, Dan Suciu
:
Insert-Only versus Insert-Delete in Dynamic Query Evaluation. CoRR abs/2312.09331 (2023) - 2022
- [j34]Amir Shaikhha
, Mathieu Huot
, Jaclyn Smith
, Dan Olteanu
:
Functional collection programming with semi-ring dictionaries. Proc. ACM Program. Lang. 6(OOPSLA1): 1-33 (2022) - [c59]Mahmoud Abo Khamis
, George Chichirim, Antonia Kormpa, Dan Olteanu:
The Complexity of Boolean Conjunctive Queries with Intersection Joins. PODS 2022: 53-65 - [c58]Dan Olteanu, Nils Vortmeier, Dorde Zivanovic:
Givens QR Decomposition over Relational Databases. SIGMOD Conference 2022: 1948-1961 - [e4]Dan Olteanu, Nils Vortmeier:
25th International Conference on Database Theory, ICDT 2022, March 29 to April 1, 2022, Edinburgh, UK (Virtual Conference). LIPIcs 220, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-223-5 [contents] - [i35]Dan Olteanu, Nils Vortmeier, Dorde Zivanovic:
Givens QR Decomposition over Relational Databases. CoRR abs/2204.00525 (2022) - [i34]Ahmet Kara
, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Conjunctive Queries with Output Access Patterns under Updates. CoRR abs/2206.09032 (2022) - 2021
- [j33]Amir Shaikhha, Maximilian Schleich, Dan Olteanu:
An Intermediate Representation for Hybrid Database and Machine Learning Workloads. Proc. VLDB Endow. 14(12): 2831-2834 (2021) - [j32]Dan Olteanu:
Technical Perspective: Probabilistic Data with Continuous Distributions. SIGMOD Rec. 50(1): 68 (2021) - [c57]Ahmet Kara
, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Machine learning over static and dynamic relational data. DEBS 2021: 160-163 - [i33]Amir Shaikhha, Mathieu Huot, Jaclyn Smith, Dan Olteanu:
Functional Collection Programming with Semi-Ring Dictionaries. CoRR abs/2103.06376 (2021) - [i32]Mahmoud Abo Khamis, George Chichirim, Antonia Kormpa, Dan Olteanu:
The Complexity of Boolean Conjunctive Queries with Intersection Joins. CoRR abs/2106.13342 (2021) - [i31]Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Machine Learning over Static and Dynamic Relational Data. CoRR abs/2107.13923 (2021) - 2020
- [j31]Maximilian Schleich, Dan Olteanu:
LMFAO: An Engine for Batches of Group-By Aggregates. Proc. VLDB Endow. 13(12): 2945-2948 (2020) - [j30]Dan Olteanu:
The Relational Data Borg is Learning. Proc. VLDB Endow. 13(12): 3502-3515 (2020) - [j29]Mahmoud Abo Khamis
, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies. ACM Trans. Database Syst. 45(2): 7:1-7:66 (2020) - [j28]Ahmet Kara
, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Maintaining Triangle Queries under Updates. ACM Trans. Database Syst. 45(3): 11:1-11:46 (2020) - [j27]Mahmoud Abo Khamis
, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Functional Aggregate Queries with Additive Inequalities. ACM Trans. Database Syst. 45(4): 17:1-17:41 (2020) - [c56]Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Rk-means: Fast Clustering for Relational Data. AISTATS 2020: 2742-2752 - [c55]Amir Shaikhha, Maximilian Schleich, Alexandru Ghita, Dan Olteanu:
Multi-layer optimizations for end-to-end data analytics. CGO 2020: 145-157 - [c54]Ahmet Kara
, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries. PODS 2020: 375-392 - [c53]Milos Nikolic, Haozhe Zhang, Ahmet Kara
, Dan Olteanu:
F-IVM: Learning over Fast-Evolving Relational Data. SIGMOD Conference 2020: 2773-2776 - [e3]Angela Bonifati, Yongluan Zhou, Marcos Antonio Vaz Salles, Alexander Böhm, Dan Olteanu, George H. L. Fletcher, Arijit Khan, Bin Yang:
Proceedings of the 23rd International Conference on Extending Database Technology, EDBT 2020, Copenhagen, Denmark, March 30 - April 02, 2020. OpenProceedings.org 2020, ISBN 978-3-89318-083-7 [contents] - [i30]Amir Shaikhha, Maximilian Schleich, Alexandru Ghita, Dan Olteanu:
Multi-layer Optimizations for End-to-End Data Analytics. CoRR abs/2001.03541 (2020) - [i29]Ahmet Kara, Milos Nikolic, Hung Q. Ngo, Dan Olteanu, Haozhe Zhang:
Maintaining Triangle Queries under Updates. CoRR abs/2004.03716 (2020) - [i28]Milos Nikolic, Haozhe Zhang, Ahmet Kara, Dan Olteanu:
F-IVM: Learning over Fast-Evolving Relational Data. CoRR abs/2006.00694 (2020) - [i27]Dan Olteanu:
The Relational Data Borg is Learning. CoRR abs/2008.07864 (2020) - [i26]Maximilian Schleich, Dan Olteanu:
LMFAO: An Engine for Batches of Group-By Aggregates. CoRR abs/2008.08657 (2020)
2010 – 2019
- 2019
- [c52]Dan Olteanu:
Learning Models over Relational Databases (Invited Talk). ICDT 2019: 1:1-1:1 - [c51]Ahmet Kara
, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Counting Triangles under Updates in Worst-Case Optimal Time. ICDT 2019: 4:1-4:18 - [c50]Mahmoud Abo Khamis
, Hung Q. Ngo, Dan Olteanu, Dan Suciu
:
Boolean Tensor Decomposition for Conjunctive Queries with Negation. ICDT 2019: 21:1-21:19 - [c49]Mahmoud Abo Khamis
, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. PODS 2019: 414-431 - [c48]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis
, Hung Q. Ngo, XuanLong Nguyen:
A Layered Aggregate Engine for Analytics Workloads. SIGMOD Conference 2019: 1642-1659 - [c47]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen:
Learning Models over Relational Data: A Brief Tutorial. SUM 2019: 423-432 - [i25]Iman Elghandour, Ahmet Kara, Dan Olteanu, Stijn Vansummeren:
Incremental Techniques for Large-Scale Dynamic Query Processing. CoRR abs/1902.00585 (2019) - [i24]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen:
A Layered Aggregate Engine for Analytics Workloads. CoRR abs/1906.08687 (2019) - [i23]Ahmet Kara, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries. CoRR abs/1907.01988 (2019) - [i22]Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
Rk-means: Fast Clustering for Relational Data. CoRR abs/1910.04939 (2019) - [i21]Maximilian Schleich, Dan Olteanu, Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen:
Learning Models over Relational Data: A Brief Tutorial. CoRR abs/1911.06577 (2019) - [i20]Mikaël Monet, Dan Olteanu:
Towards Deterministic Decomposable Circuits for Safe Queries. CoRR abs/1912.11098 (2019) - 2018
- [c46]Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Counting Triangles under Updates. AMW 2018 - [c45]Mikaël Monet, Dan Olteanu:
Towards Deterministic Decomposable Circuits for Safe Queries. AMW 2018 - [c44]Iman Elghandour, Ahmet Kara
, Dan Olteanu, Stijn Vansummeren:
Incremental Techniques for Large-Scale Dynamic Query Processing. CIKM 2018: 2297-2298 - [c43]Ahmet Kara
, Dan Olteanu:
Covers of Query Results. ICDT 2018: 16:1-16:22 - [c42]Mahmoud Abo Khamis
, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
In-Database Learning with Sparse Tensors. PODS 2018: 325-340 - [c41]Mahmoud Abo Khamis
, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
AC/DC: In-Database Learning Thunderstruck. DEEM@SIGMOD 2018: 8:1-8:10 - [c40]Milos Nikolic, Dan Olteanu:
Incremental View Maintenance with Triple Lock Factorization Benefits. SIGMOD Conference 2018: 365-380 - [e2]Dan Olteanu, Barbara Poblete:
Proceedings of the 12th Alberto Mendelzon International Workshop on Foundations of Data Management, Cali, Colombia, May 21-25, 2018. CEUR Workshop Proceedings 2100, CEUR-WS.org 2018 [contents] - [r2]Christoph Koch, Dan Olteanu:
Uncertain Data Models. Encyclopedia of Database Systems (2nd ed.) 2018 - [r1]Nilesh N. Dalvi, Dan Olteanu:
Query Processing over Uncertain Data. Encyclopedia of Database Systems (2nd ed.) 2018 - [i19]Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
AC/DC: In-Database Learning Thunderstruck. CoRR abs/1803.07480 (2018) - [i18]Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, Haozhe Zhang:
Counting Triangles under Updates in Worst-Case Optimal Time. CoRR abs/1804.02780 (2018) - [i17]Mahmoud Abo Khamis, Ryan R. Curtin, Benjamin Moseley, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
On Functional Aggregate Queries with Additive Inequalities. CoRR abs/1812.09526 (2018) - 2017
- [j26]Dan Olteanu, Florin Rusu:
Special issue on in-database analytics. Distributed Parallel Databases 35(3-4): 333-334 (2017) - [j25]Dan Olteanu:
Technical Perspective: Juggling Functions Inside a Database. SIGMOD Rec. 46(1): 5 (2017) - [j24]Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena:
Declarative Probabilistic Programming with Datalog. ACM Trans. Database Syst. 42(4): 22:1-22:35 (2017) - [c39]Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
In-Database Factorized Learning. AMW 2017 - [i16]Mahmoud Abo Khamis, Hung Q. Ngo, XuanLong Nguyen, Dan Olteanu, Maximilian Schleich:
In-Database Learning with Sparse Tensors. CoRR abs/1703.04780 (2017) - [i15]Milos Nikolic, Dan Olteanu:
Incremental Maintenance of Regression Models over Joins. CoRR abs/1703.07484 (2017) - [i14]Ahmet Kara, Dan Olteanu:
Covers of Query Results. CoRR abs/1709.01600 (2017) - [i13]Mahmoud Abo Khamis, Hung Q. Ngo, Dan Olteanu, Dan Suciu:
Boolean Tensor Decomposition for Conjunctive Queries with Negation. CoRR abs/1712.07445 (2017) - 2016
- [j23]Dan Olteanu, Maximilian Schleich:
F: Regression Models over Factorized Views. Proc. VLDB Endow. 9(13): 1573-1576 (2016) - [j22]Dan Olteanu, Maximilian Schleich:
Factorized Databases. SIGMOD Rec. 45(2): 5-16 (2016) - [j21]Dan Olteanu, Sebastiaan J. van Schaik:
ENFrame: A Framework for Processing Probabilistic Data. ACM Trans. Database Syst. 41(1): 3:1-3:44 (2016) - [j20]Robert Fink, Dan Olteanu:
Dichotomies for Queries with Negation in Probabilistic Databases. ACM Trans. Database Syst. 41(1): 4:1-4:47 (2016) - [c38]Dan Olteanu:
Factorized Databases: A Knowledge Compilation Perspective. AAAI Workshop: Beyond NP 2016 - [c37]Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena:
Declarative Probabilistic Programming with Datalog. ICDT 2016: 7:1-7:19 - [c36]Maximilian Schleich, Dan Olteanu, Radu Ciucanu:
Learning Linear Regression Models over Factorized Joins. SIGMOD Conference 2016: 3-18 - 2015
- [j19]Todd J. Green, Dan Olteanu, Geoffrey Washburn:
Live Programming in the LogicBlox System: A MetaLogiQL Approach. Proc. VLDB Endow. 8(12): 1782-1791 (2015) - [j18]Dan Olteanu, Jakub Závodný:
Size Bounds for Factorised Representations of Query Results. ACM Trans. Database Syst. 40(1): 2:1-2:44 (2015) - [c35]Balder ten Cate, Benny Kimelfeld, Dan Olteanu:
PPDL: Probabilistic Programming with Datalog. AMW 2015 - [c34]Dan Olteanu:
Factorized Databases: Past and Future Past. AMW 2015 - [c33]Molham Aref, Balder ten Cate, Todd J. Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L. Veldhuizen, Geoffrey Washburn:
Design and Implementation of the LogicBlox System. SIGMOD Conference 2015: 1371-1382 - 2014
- [j17]Dan Olteanu, Sebastiaan J. van Schaik:
Probabilistic Data Programming with ENFrame. IEEE Data Eng. Bull. 37(3): 18-25 (2014) - [c32]Boris Motik, Yavor Nenov, Robert Piro, Ian Horrocks, Dan Olteanu:
Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF Systems. AAAI 2014: 129-137 - [c31]Boris Motik, Yavor Nenov, Robert Piro, Ian Horrocks, Dan Olteanu:
Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems. Description Logics 2014: 311-323 - [c30]Sebastiaan J. van Schaik, Dan Olteanu, Robert Fink:
ENFrame: A Platform for Processing Probabilistic Data. EDBT 2014: 355-366 - [c29]Robert Fink, Dan Olteanu:
A dichotomy for non-repeating queries with negation in probabilistic databases. PODS 2014: 144-155 - [i12]Vince Bárány, Balder ten Cate, Benny Kimelfeld, Dan Olteanu, Zografoula Vagena:
Declarative Statistical Modeling with Datalog. CoRR abs/1412.2221 (2014) - 2013
- [j16]Dan Olteanu, Divesh Srivastava:
Front Matter. Proc. VLDB Endow. 6(5): i-x (2013) - [j15]Nurzhan Bakibayev, Tomás Kociský, Dan Olteanu, Jakub Zavodny:
Aggregation and Ordering in Factorised Databases. Proc. VLDB Endow. 6(14): 1990-2001 (2013) - [j14]Michael Benedikt
, Dan Olteanu:
Report on the first workshop on innovative querying of streams. SIGMOD Rec. 42(2): 59-63 (2013) - [j13]Robert Fink, Jiewen Huang, Dan Olteanu:
Anytime approximation in probabilistic databases. VLDB J. 22(6): 823-848 (2013) - [c28]Dan Olteanu, Lampros Papageorgiou, Sebastiaan J. van Schaik:
Πgora: An Integration System for Probabilistic Data. ICDE 2013: 1324-1327 - [e1]Georg Gottlob, Giovanni Grasso
, Dan Olteanu, Christian Schallhart:
Big Data - 29th British National Conference on Databases, BNCOD 2013, Oxford, UK, July 8-10, 2013. Proceedings. Lecture Notes in Computer Science 7968, Springer 2013, ISBN 978-3-642-39466-9 [contents] - [i11]Nurzhan Bakibayev, Tomás Kociský, Dan Olteanu, Jakub Zavodny:
Aggregation and Ordering in Factorised Databases. CoRR abs/1307.0441 (2013) - [i10]Sebastiaan J. van Schaik, Dan Olteanu, Robert Fink:
ENFrame: A Platform for Processing Probabilistic Data. CoRR abs/1309.0373 (2013) - 2012
- [j12]Robert Fink, Larisa Han, Dan Olteanu:
Aggregation in Probabilistic Databases via Knowledge Compilation. Proc. VLDB Endow. 5(5): 490-501 (2012) - [j11]Nurzhan Bakibayev, Dan Olteanu, Jakub Zavodny:
FDB: A Query Engine for Factorised Relational Databases. Proc. VLDB Endow. 5(11): 1232-1243 (2012) - [j10]Nurzhan Bakibayev, Dan Olteanu, Jakub Zavodny:
Demonstration of the FDB Query Engine for Factorised Databases. Proc. VLDB Endow. 5(12): 1950-1953 (2012) - [c27]Dan Olteanu, Hongkai Wen
:
Ranking Query Answers in Probabilistic Databases: Complexity and Efficient Algorithms. ICDE 2012: 282-293 - [c26]Dan Olteanu, Jakub Zavodny:
Factorised representations of query results: size bounds and readability. ICDT 2012: 285-298 - [c25]Dan Olteanu, Sebastiaan J. van Schaik:
DAGger: clustering correlated uncertain data (to predict asset failure in energy networks). KDD 2012: 1504-1507 - [i9]Robert Fink, Larisa Han, Dan Olteanu:
Aggregation in Probabilistic Databases via Knowledge Compilation. CoRR abs/1201.6569 (2012) - [i8]Nurzhan Bakibayev, Dan Olteanu, Jakub Zavodny:
FDB: A Query Engine for Factorised Relational Databases. CoRR abs/1203.2672 (2012) - 2011
- [b2]Dan Suciu, Dan Olteanu, Christopher Ré, Christoph Koch:
Probabilistic Databases. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2011, ISBN 978-3-031-00751-4 - [j9]Philippe Bonnet
, Stefan Manegold, Matias Bjørling, Wei Cao, Javier González, Joel A. Granados, Nancy Hall, Stratos Idreos, Milena Ivanova, Ryan Johnson, David Koop, Tim Kraska, René Müller, Dan Olteanu, Paolo Papotti
, Christine Reilly, Dimitris Tsirogiannis, Cong Yu, Juliana Freire
, Dennis E. Shasha:
Repeatability and workability evaluation of SIGMOD 2011. SIGMOD Rec. 40(2): 45-48 (2011) - [c24]Robert Fink, Dan Olteanu, Swaroop Rath:
Providing support for full relational algebra in probabilistic databases. ICDE 2011: 315-326 - [c23]Robert Fink, Dan Olteanu:
On the optimal approximation of queries using tractable propositional languages. ICDT 2011: 174-185 - [c22]Robert Fink, Andrew Hogue, Dan Olteanu, Swaroop Rath:
SPROUT2: a squared query engine for uncertain web data. SIGMOD Conference 2011: 1299-1302 - [i7]Dan Olteanu, Jakub Zavodny:
Factorised Representations of Query Results. CoRR abs/1104.0867 (2011) - 2010
- [j8]Michael Benedikt, Evgeny Kharlamov, Dan Olteanu, Pierre Senellart
:
Probabilistic XML via Markov Chains. Proc. VLDB Endow. 3(1): 770-781 (2010) - [c21]Abhay Kumar Jha, Dan Olteanu, Dan Suciu
:
Bridging the gap between intensional and extensional query evaluation in probabilistic databases. EDBT 2010: 323-334 - [c20]Dan Olteanu, Jiewen Huang, Christoph Koch:
Approximate confidence computation in probabilistic databases. ICDE 2010: 145-156
2000 – 2009
- 2009
- [j7]Lyublena Antova, Christoph Koch, Dan Olteanu:
10(106) worlds and beyond: efficient representation and processing of incomplete information. VLDB J. 18(5): 1021-1040 (2009) - [c19]Dan Olteanu, Jiewen Huang, Christoph Koch:
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases. ICDE 2009: 640-651 - [c18]Dan Olteanu, Jiewen Huang:
Secondary-storage confidence computation for conjunctive queries with inequalities. SIGMOD Conference 2009: 389-402 - [c17]Jiewen Huang, Lyublena Antova, Christoph Koch, Dan Olteanu:
MayBMS: a probabilistic database management system. SIGMOD Conference 2009: 1071-1074 - 2008
- [j6]Christoph Koch, Dan Olteanu:
Conditioning probabilistic databases. Proc. VLDB Endow. 1(1): 313-325 (2008) - [j5]Dan Olteanu, Christoph Koch, Lyublena Antova:
World-set decompositions: Expressiveness and efficient algorithms. Theor. Comput. Sci. 403(2-3): 265-284 (2008) - [c16]Lyublena Antova, Thomas Jansen, Christoph Koch, Dan Olteanu:
Fast and Simple Relational Processing of Uncertain Data. ICDE 2008: 983-992 - [c15]Dan Olteanu, Jiewen Huang:
Using OBDDs for Efficient Query Evaluation on Probabilistic Databases. SUM 2008: 326-340 - [i6]Christoph Koch, Peter J. Haas, Hans-Joachim Lenz, Dan Olteanu, Christopher Ré, Maurice van Keulen, Jeff Z. Pan:
08421 Working Group: Report of the Probabilistic Databases Benchmarking. Uncertainty Management in Information Systems 2008 - [i5]Anish Das Sarma, Ander de Keijzer, Amol Deshpande, Peter J. Haas, Ihab F. Ilyas, Christoph Koch, Thomas Neumann, Dan Olteanu, Martin Theobald
, Vasilis Vassalos:
08421 Working Group: Classification, Representation and Modeling. Uncertainty Management in Information Systems 2008 - [i4]Christoph Koch, Dan Olteanu:
Conditioning Probabilistic Databases. CoRR abs/0803.2212 (2008) - 2007
- [j4]Dan Olteanu:
SPEX: Streamed and Progressive Evaluation of XPath. IEEE Trans. Knowl. Data Eng. 19(7): 934-949 (2007) - [j3]Dan Olteanu:
Forward node-selecting queries over trees. ACM Trans. Database Syst. 32(1): 3 (2007) - [c14]Lyublena Antova, Christoph Koch, Dan Olteanu:
10106 Worlds and Beyond: Efficient Representation and Processing of Incomplete Information. ICDE 2007: 606-615 - [c13]Lyublena Antova, Christoph Koch, Dan Olteanu:
MayBMS: Managing Incomplete Information with Probabilistic World-Set Decompositions. ICDE 2007: 1479-1480 - [c12]Lyublena Antova, Christoph Koch, Dan Olteanu:
World-Set Decompositions: Expressiveness and Efficient Algorithms. ICDT 2007: 194-208 - [c11]Lyublena Antova, Christoph Koch, Dan Olteanu:
From complete to incomplete information and back. SIGMOD Conference 2007: 713-724 - [c10]Lyublena Antova, Christoph Koch, Dan Olteanu:
Query language support for incomplete information in the MayBMS system. VLDB 2007: 1422-1425 - [i3]Lyublena Antova, Christoph Koch, Dan Olteanu:
World-set Decompositions: Expressiveness and Efficient Algorithms. CoRR abs/0705.4442 (2007) - [i2]Lyublena Antova, Thomas Jansen, Christoph Koch, Dan Olteanu:
Fast and Simple Relational Processing of Uncertain Data. CoRR abs/0707.1644 (2007) - 2006
- [c9]Dan Olteanu:
Accelerating XPath Evaluation against XML Streams. PLAN-X 2006: 82 - [c8]Christoph Koch, Dan Olteanu, Stefanie Scherzinger:
Building a Native XML-DBMS as a Term Project in a Database Systems Course. XIME-P 2006 - [i1]Lyublena Antova, Christoph Koch, Dan Olteanu:
10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information. CoRR abs/cs/0606075 (2006) - 2005
- [c7]François Bry
, Fatih Coskun, Serap Durmaz, Tim Furche, Dan Olteanu, Markus Spannagel:
The XML Stream Query Processor SPEX. ICDE 2005: 1120-1121 - 2004
- [b1]Dan Olteanu:
Evaluation of XPath queries against XML streams. Ludwig Maximilian University of Munich, Germany, 2004, pp. 1-194 - [j2]François Bry, Tim Furche, Dan Olteanu:
Datenströme. Inform. Spektrum 27(2): 168-171 (2004) - [c6]Dan Olteanu, Tim Furche, François Bry:
Evaluating Complex Queries Against XML Streams with Polynomial Combined Complexity. BNCOD 2004: 31-44 - [c5]Dan Olteanu, Tim Furche, François Bry:
An efficient single-pass query evaluator for XML data streams. SAC 2004: 627-631 - 2003
- [c4]Dan Olteanu, Tobias Kiesling, François Bry
:
An Evaluation of Regular Path Expressions with Qualifiers against XML Streams. ICDE 2003: 702-704 - 2002
- [c3]Dan Olteanu, Holger Meuss, Tim Furche, François Bry:
XPath: Looking Forward. EDBT Workshops 2002: 109-127 - 2001
- [j1]François Bry, Michael Kraus, Dan Olteanu, Sebastian Schaffert:
Semistrukturierte Daten - Aktuelles Schlagwort. Inform. Spektrum 24(4): 230-233 (2001) - [c2]François Bry
, Dan Olteanu, Sebastian Schaffert:
Towards Grouping Constructs for Semistructured Data. DEXA Workshop 2001: 66-70 - 2000
- [c1]Ioana Manolescu, Daniela Florescu, Donald Kossmann, Florian Xhumari, Dan Olteanu:
Agora: Living with XML and Relational. VLDB 2000: 623-626
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint