![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2024
- Otmar Ertl:
UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting. Proc. VLDB Endow. 17(7): 1655-1668 (2024) - Pedro Reviriego
, Jim Apple
, Álvaro Alonso
, Otmar Ertl, Niv Dayan
:
Cardinality Estimation Adaptive Cuckoo Filters (CE-ACF): Approximate Membership Check and Distinct Query Count for High-Speed Network Monitoring. IEEE/ACM Trans. Netw. 32(2): 959-970 (2024) - Adriano Vogel, Sören Henning, Esteban Pérez-Wohlfeil, Otmar Ertl, Rick Rabiser:
A Comprehensive Benchmarking Analysis of Fault Recovery in Stream Processing Frameworks. DEBS 2024: 171-182 - Sören Henning
, Adriano Vogel
, Michael Leichtfried
, Otmar Ertl
, Rick Rabiser
:
ShuffleBench: A Benchmark for Large-Scale Data Shuffling Operations with Distributed Stream Processing Frameworks. ICPE 2024: 2-13 - Otmar Ertl:
ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale. CoRR abs/2402.13726 (2024) - Sören Henning, Adriano Vogel, Michael Leichtfried, Otmar Ertl, Rick Rabiser:
ShuffleBench: A Benchmark for Large-Scale Data Shuffling Operations with Distributed Stream Processing Frameworks. CoRR abs/2403.04570 (2024) - Otmar Ertl:
JumpBackHash: Say Goodbye to the Modulo Operation to Distribute Keys Uniformly to Buckets. CoRR abs/2403.18682 (2024) - Adriano Vogel, Sören Henning, Esteban Pérez-Wohlfeil, Otmar Ertl, Rick Rabiser:
A Comprehensive Benchmarking Analysis of Fault Recovery in Stream Processing Frameworks. CoRR abs/2404.06203 (2024) - Adriano Vogel, Sören Henning, Esteban Pérez-Wohlfeil, Otmar Ertl, Rick Rabiser:
High-level Stream Processing: A Complementary Analysis of Fault Recovery. CoRR abs/2405.07917 (2024) - 2023
- Sören Henning, Adriano Vogel, Michael Leichtfried, Otmar Ertl, Rick Rabiser:
Benchmarking Stream Processing Frameworks for Large Scale Data Shuffling. Softwaretechnik-Trends 43(4) (2023) - Adriano Vogel, Sören Henning, Otmar Ertl, Rick Rabiser:
A systematic mapping of performance in distributed stream processing systems. SEAA 2023: 293-300 - Otmar Ertl:
UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting. CoRR abs/2308.16862 (2023) - 2022
- Pedro Reviriego
, Shanshan Liu
, Otmar Ertl
, Farzad Niknia, Fabrizio Lombardi
:
Computing the Similarity Estimate Using Approximate Memory. IEEE Trans. Emerg. Top. Comput. 10(3): 1593-1604 (2022) - Otmar Ertl
:
ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity. IEEE Trans. Knowl. Data Eng. 34(7): 3491-3506 (2022) - 2021
- Otmar Ertl:
SetSketch: Filling the Gap between MinHash and HyperLogLog. Proc. VLDB Endow. 14(11): 2244-2257 (2021) - Otmar Ertl:
SetSketch: Filling the Gap between MinHash and HyperLogLog. CoRR abs/2101.00314 (2021) - Otmar Ertl:
Estimation from Partially Sampled Distributed Traces. CoRR abs/2107.07703 (2021) - 2019
- Ted Dunning, Otmar Ertl:
Computing Extremely Accurate Quantiles Using t-Digests. CoRR abs/1902.04023 (2019) - Otmar Ertl:
ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity. CoRR abs/1911.00675 (2019) - 2018
- Otmar Ertl:
BagMinHash - Minwise Hashing Algorithm for Weighted Sets. KDD 2018: 1368-1377 - Otmar Ertl:
BagMinHash - Minwise Hashing Algorithm for Weighted Sets. CoRR abs/1802.03914 (2018) - 2017
- Otmar Ertl:
New cardinality estimation algorithms for HyperLogLog sketches. CoRR abs/1702.01284 (2017) - Otmar Ertl:
SuperMinHash - A New Minwise Hashing Algorithm for Jaccard Similarity Estimation. CoRR abs/1706.05698 (2017) - Otmar Ertl:
New Cardinality Estimation Methods for HyperLogLog Sketches. CoRR abs/1706.07290 (2017) - 2009
- Otmar Ertl, Siegfried Selberherr
:
A fast level set framework for large three-dimensional topography simulations. Comput. Phys. Commun. 180(8): 1242-1250 (2009)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.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.
retrieved on 2024-07-27 09:01 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint