Abstract is missing.
- Minimizing Bias in Estimation of Mutual Information from Data StreamsVadim Arzamasov, Klemens Böhm, Ignaz Rutter. 1-12 [doi]
- Monte Carlo Dependency EstimationEdouard Fouché, Klemens Böhm. 13-24 [doi]
- Outlier Detection in Non-stationary Data StreamsLuan Tran, Liyue Fan, Cyrus Shahabi. 25-36 [doi]
- Dynamap: Schema Mapping Generation in the WildLacramioara Mazilu, Norman W. Paton, Alvaro A. A. Fernandes, Martin Koehler. 37-48 [doi]
- Discovering Spatial High Utility Itemsets in Spatiotemporal DatabasesR. Uday Kiran, Koji Zettsu, Masashi Toyoda, Philippe Fournier-Viger, P. Krishna Reddy, Masaru Kitsuregawa. 49-60 [doi]
- Efficient Incremental Cooccurrence Analysis for Item-Based Collaborative FilteringSebastian Schelter, Ufuk Celebi, Ted Dunning. 61-72 [doi]
- Maintaining Wavelet Synopses for Sliding-Window AggregatesIoannis Mytilinis, Dimitrios Tsoumakos, Nectarios Koziris. 73-84 [doi]
- An Efficient Graph Compressor Based on Adaptive Prefix EncodingJinho Lee, Frank Liu. 85-96 [doi]
- Informative Summarization of Numeric DataMichael Vollmer, Lukasz Golab, Klemens Böhm, Divesh Srivastava. 97-108 [doi]
- Less Data Delivers Higher Search Effectiveness for Keyword QueriesVahid Ghadakchi, Abtin Khodadadi, Arash Termehchy. 109-120 [doi]
- An Experimental Study of Context-Free Path Query Evaluation MethodsJochem Kuijpers, George H. L. Fletcher, Nikolay Yakovets, Tobias Lindaaker. 121-132 [doi]
- Keep Your Host Language Object and Also Query it: A Case for SQL Query Support in RDBMS for Host Language ObjectsJoseph Vinish D'silva, Florestan De Moor, Bettina Kemme. 133-144 [doi]
- Accelerating array joining with integrated value-indexHaoyuan Xing, Gagan Agrawal. 145-156 [doi]
- A High-level User-oriented Framework for Database EvolutionRobert E. Schuler, Carl Kesselman. 157-168 [doi]
- Versioning in Main-Memory Database Systems: From MusaeusDB to TardisDBMaximilian E. Schüle, Lukas Karnowski, Josef Schmeißer, Benedikt Kleiner, Alfons Kemper, Thomas Neumann 0001. 169-180 [doi]
- LUCK- Linear Correlation Clustering Using Cluster Algorithms and a kNN based Distance FunctionAnna Beer, Daniyal Kazempour, Lisa Stephan, Thomas Seidl 0001. 181-184 [doi]
- Graph Ordering and Clustering: A Circular ApproachAnna Beer, Thomas Seidl 0001. 185-188 [doi]
- Towards Generalizing Stochastic Spatiotemporal Graphs for Analyzing Least-Cost Path StabilityChris J. Michael, Joseph P. Macker, Frederick E. Petry. 189-192 [doi]
- REDS: Estimating the Performance of Error Detection Strategies Based on Dirtiness ProfilesMohammad Mahdavi, Ziawasch Abedjan. 193-196 [doi]
- Deep Stacked Ensemble RecommenderRasaq Otunba, Raimi A. Rufai, Jessica Lin 0001. 197-201 [doi]
- Terabyte-scale Particle Data Analysis: An ArrayUDF Case StudyBin Dong, Patrick Kilian, Xiaocan Li, Fan Guo, Suren Byna, Kesheng Wu. 202-205 [doi]
- Improvement of SQL Recommendation on Scientific DatabaseJianjun Liu, Zainab Zolaktaf, Rachel Pottinger, Mostafa Milani. 206-209 [doi]
- An Experimental Survey of Evaluation Strategies for Constellation QueriesGlenn Galvizo, Lipyeow Lim. 210-213 [doi]
- A New Polynomial-time Support Measure for Counting Frequent Patterns in GraphsJinghan Meng, Yi-Cheng Tu, Napath Pitaksirianan. 214-217 [doi]
- SQUID: A Scalable System for Querying, Updating and Indexing Dynamic Graph DatabasesAkshay Kansal, Francesca Spezzano. 218-221 [doi]
- Detecting Global Periodic Correlated Clusters in Event Series based on Parameter Space TransformDaniyal Kazempour, Kilian Emmerig, Peer Kröger, Thomas Seidl 0001. 222-225 [doi]
- On systematic hyperparameter analysis through the example of subspace clusteringDaniyal Kazempour, Thomas Seidl 0001. 226-229 [doi]