![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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
no 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 28 matches
- 2019
- Vadim Arzamasov, Klemens Böhm, Ignaz Rutter
:
Minimizing Bias in Estimation of Mutual Information from Data Streams. SSDBM 2019: 1-12 - Anna Beer
, Thomas Seidl
:
Graph Ordering and Clustering: A Circular Approach. SSDBM 2019: 185-188 - Anna Beer
, Daniyal Kazempour, Lisa Stephan, Thomas Seidl
:
LUCK- Linear Correlation Clustering Using Cluster Algorithms and a kNN based Distance Function. SSDBM 2019: 181-184 - Bin Dong, Patrick Kilian, Xiaocan Li, Fan Guo, Suren Byna
, Kesheng Wu
:
Terabyte-scale Particle Data Analysis: An ArrayUDF Case Study. SSDBM 2019: 202-205 - Joseph Vinish D'silva, Florestan De Moor, Bettina Kemme:
Keep Your Host Language Object and Also Query it: A Case for SQL Query Support in RDBMS for Host Language Objects. SSDBM 2019: 133-144 - Edouard Fouché, Klemens Böhm:
Monte Carlo Dependency Estimation. SSDBM 2019: 13-24 - Glenn Galvizo, Lipyeow Lim:
An Experimental Survey of Evaluation Strategies for Constellation Queries. SSDBM 2019: 210-213 - Vahid Ghadakchi, Abtin Khodadadi, Arash Termehchy:
Less Data Delivers Higher Search Effectiveness for Keyword Queries. SSDBM 2019: 109-120 - Akshay Kansal, Francesca Spezzano
:
SQUID: A Scalable System for Querying, Updating and Indexing Dynamic Graph Databases. SSDBM 2019: 218-221 - Daniyal Kazempour, Thomas Seidl
:
On systematic hyperparameter analysis through the example of subspace clustering. SSDBM 2019: 226-229 - Daniyal Kazempour, Kilian Emmerig, Peer Kröger, Thomas Seidl
:
Detecting Global Periodic Correlated Clusters in Event Series based on Parameter Space Transform. SSDBM 2019: 222-225 - R. Uday Kiran, Koji Zettsu, Masashi Toyoda, Philippe Fournier-Viger
, P. Krishna Reddy, Masaru Kitsuregawa:
Discovering Spatial High Utility Itemsets in Spatiotemporal Databases. SSDBM 2019: 49-60 - Jochem Kuijpers, George H. L. Fletcher, Nikolay Yakovets, Tobias Lindaaker:
An Experimental Study of Context-Free Path Query Evaluation Methods. SSDBM 2019: 121-132 - Jinho Lee, Frank Liu:
An Efficient Graph Compressor Based on Adaptive Prefix Encoding. SSDBM 2019: 85-96 - Jianjun Liu, Zainab Zolaktaf, Rachel Pottinger, Mostafa Milani:
Improvement of SQL Recommendation on Scientific Database. SSDBM 2019: 206-209 - Mohammad Mahdavi, Ziawasch Abedjan
:
REDS: Estimating the Performance of Error Detection Strategies Based on Dirtiness Profiles. SSDBM 2019: 193-196 - Lacramioara Mazilu
, Norman W. Paton, Alvaro A. A. Fernandes, Martin Koehler:
Dynamap: Schema Mapping Generation in the Wild. SSDBM 2019: 37-48 - Jinghan Meng, Yi-Cheng Tu, Napath Pitaksirianan:
A New Polynomial-time Support Measure for Counting Frequent Patterns in Graphs. SSDBM 2019: 214-217 - Chris J. Michael, Joseph P. Macker, Frederick E. Petry:
Towards Generalizing Stochastic Spatiotemporal Graphs for Analyzing Least-Cost Path Stability. SSDBM 2019: 189-192 - Ioannis Mytilinis, Dimitrios Tsoumakos, Nectarios Koziris:
Maintaining Wavelet Synopses for Sliding-Window Aggregates. SSDBM 2019: 73-84 - Rasaq Otunba, Raimi A. Rufai
, Jessica Lin:
Deep Stacked Ensemble Recommender. SSDBM 2019: 197-201 - Sebastian Schelter, Ufuk Celebi, Ted Dunning
:
Efficient Incremental Cooccurrence Analysis for Item-Based Collaborative Filtering. SSDBM 2019: 61-72 - Maximilian E. Schüle
, Lukas Karnowski, Josef Schmeißer, Benedikt Kleiner, Alfons Kemper, Thomas Neumann:
Versioning in Main-Memory Database Systems: From MusaeusDB to TardisDB. SSDBM 2019: 169-180 - Robert E. Schuler
, Carl Kesselman
:
A High-level User-oriented Framework for Database Evolution. SSDBM 2019: 157-168 - Luan V. Tran, Liyue Fan, Cyrus Shahabi:
Outlier Detection in Non-stationary Data Streams. SSDBM 2019: 25-36 - Michael Vollmer, Lukasz Golab, Klemens Böhm, Divesh Srivastava:
Informative Summarization of Numeric Data. SSDBM 2019: 97-108 - Haoyuan Xing, Gagan Agrawal:
Accelerating array joining with integrated value-index. SSDBM 2019: 145-156 - Carlos Maltzahn, Tanu Malik:
Proceedings of the 31st International Conference on Scientific and Statistical Database Management, SSDBM 2019, Santa Cruz, CA, USA, July 23-25, 2019. ACM 2019, ISBN 978-1-4503-6216-0 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.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-02 06:39 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