default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID26th SSDBM 2014: Aalborg, Denmark
- Christian S. Jensen, Hua Lu, Torben Bach Pedersen, Christian Thomsen, Kristian Torp:
Conference on Scientific and Statistical Database Management, SSDBM '14, Aalborg, Denmark, June 30 - July 02, 2014. ACM 2014, ISBN 978-1-4503-2722-0
Case studies
- I-Min A. Chen, Victor M. Markowitz, Ernest Szeto, Krishna Palaniappan
, Ken Chu:
Maintaining a microbial genome & metagenome data analysis system in an academic setting. 3:1-3:11 - Dániel Kondor, László Dobos, István Csabai, András Bodor, Gábor Vattay, Tamás Budavári, Alexander S. Szalay:
Efficient classification of billions of points into complex geographic regions using hierarchical triangular mesh. 4:1-4:4
Spatial and spatio-temporal data
- Bettina Fazzinga, Sergio Flesca, Filippo Furfaro, Francesco Parisi:
Offline cleaning of RFID trajectory data. 5:1-5:12 - Suprio Ray, Bogdan Simion, Angela Demke Brown, Ryan Johnson:
Skew-resistant parallel in-memory spatial join. 6:1-6:12 - Sajib Barua, Jörg Sander:
Mining statistically sound co-location patterns at multiple distances. 7:1-7:12 - Qiang Qu, Siyuan Liu, Bin Yang, Christian S. Jensen:
Integrating non-spatial preferences into spatial location queries. 8:1-8:12
Arrays, linear algebra, and statistics
- Yi Wang, Arnab Nandi, Gagan Agrawal:
SAGA: array storage as a DB with support for structural aggregations. 9:1-9:12 - Dimitar Misev, Peter Baumann:
Extending the SQL array concept to support scientific analytics. 10:1-10:11 - David Kernert, Frank Köhler, Wolfgang Lehner:
SLACID - sparse linear algebra in a column-oriented in-memory database system. 11:1-11:12 - Jonathan Lajus, Hannes Mühleisen:
Efficient data management and statistics with zero-copy integration. 12:1-12:10
Data mining
- Arthur Zimek, Ricardo J. G. B. Campello, Jörg Sander:
Data perturbation for outlier detection ensembles. 13:1-13:12 - Frank Höppner:
A subspace filter supporting the discovery of small clusters in very noisy datasets. 14:1-14:12 - Hina A. Khan, Mohamed A. Sharaf, Abdullah M. Albarrak:
DivIDE: efficient diversification for interactive data exploration. 15:1-15:12 - Patricia Iglesias Sánchez, Emmanuel Müller, Oretta Irmler, Klemens Böhm:
Local context selection for outlier ranking in graphs with multiple numeric node attributes. 16:1-16:12
Advanced issues
- Roland Assam, Marwan Hassani, Michael Brysch, Thomas Seidl:
(k, d)-core anonymity: structural anonymization of massive networks. 17:1-17:12 - Ying Zhang, Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Chengqi Zhang:
Matching dominance: capture the semantics of dominance for multi-dimensional uncertain objects. 18:1-18:12 - Silei Xu, Yishi Lin, Hong Xie, John C. S. Lui:
A provable algorithmic approach to product selection problems for market entry and sustainability. 19:1-19:12 - Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha:
Distributed data placement to minimize communication costs via graph partitioning. 20:1-20:12
Sensor networks and streams
- Ixent Galpin, Alan B. Stokes, George Valkanas, Alasdair J. G. Gray, Norman W. Paton, Alvaro A. A. Fernandes, Kai-Uwe Sattler, Dimitrios Gunopulos:
SensorBench: benchmarking approaches to processing wireless sensor network data. 21:1-21:12 - Besim Avci, Goce Trajcevski, Peter Scheuermann:
Managing evolving shapes in sensor networks. 22:1-22:12 - Alan B. Stokes, Norman W. Paton, Alvaro A. A. Fernandes:
Proactive adaptations in sensor network query processing. 23:1-23:12 - Bojian Xu:
Boosting the basic counting on distributed streams. 24:1-24:12
Scientific data storage and indexing
- Souvik Bhattacherjee, Amol Deshpande, Alan Sussman:
PStore: an efficient storage framework for managing scientific data. 25:1-25:12 - Anca Maria Zimmer, Philip Driessen, Philipp Kranen, Thomas Seidl:
Inverse predictions on continuous models in scientific databases. 26:1-26:12
Schema and data matching
- Ayser Armiti, Michael Gertz:
Geometric graph matching and similarity: a probabilistic approach. 27:1-27:12 - Aibo Tian, Mayank Kejriwal, Daniel P. Miranker:
Schema matching over relations, attributes, and data values. 28:1-28:12 - Abdussalam Alawini, David Maier, Kristin Tufte, Bill Howe:
Helping scientists reconnect their datasets. 29:1-29:12 - Hoang Vu Nguyen, Emmanuel Müller, Periklis Andritsos, Klemens Böhm:
Detecting correlated columns in relational databases with mixed data types. 30:1-30:12
Short papers
- Andreas Behrend, Gereon Schüller:
A case study in optimizing continuous queries using the magic update technique. 31:1-31:4 - Michele Dallachiesa, Charu C. Aggarwal, Themis Palpanas:
Node classification in uncertain graphs. 32:1-32:4 - László Dobos, István Csabai, János M. Szalai-Gindl, Tamás Budavári, Alexander S. Szalay:
Point cloud databases. 33:1-33:4 - Sebastian Dorok, Sebastian Breß, Horstfried Läpple, Gunter Saake:
Toward efficient and reliable genome analysis using main-memory database systems. 34:1-34:4 - Orestis Gkorgkas, Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg:
Efficient processing of exploratory top-k joins. 35:1-35:4 - Philipp Große, Norman May, Wolfgang Lehner:
A study of partitioning and parallel UDF execution with the SAP HANA database. 36:1-36:4 - Marwan Hassani, Philipp Kranen, Rajveer Saini, Thomas Seidl:
Subspace anytime stream clustering. 37:1-37:4 - Wenyu Huo, Vassilis J. Tsotras:
Efficient temporal shortest path queries on evolving social graphs. 38:1-38:4 - Patrick Leyshock, David Maier, Kristin Tufte:
Data movement in hybrid analytic systems: a case for automation. 39:1-39:4 - Elham Naghizade, Lars Kulik, Egemen Tanin:
Protection of sensitive trajectory datasets through spatial and temporal exchange. 40:1-40:4 - Ekow J. Otoo, Hairong Wang, Gideon Nimako:
New approaches to storing and manipulating multi-dimensional sparse arrays. 41:1-41:4 - Katharina Rausch, Eirini Ntoutsi, Kostas Stefanidis, Hans-Peter Kriegel:
Exploring subspace clustering for recommendations. 42:1-42:4 - Peter Reimann, Holger Schwarz, Bernhard Mitschang:
Data patterns to alleviate the design of scientific workflows exemplified by a bone simulation. 43:1-43:4 - Kamalas Udomlamlert, Takahiro Hara, Shojiro Nishio:
Communication-efficient preference top-k monitoring queries via subscriptions. 44:1-44:4 - Chengcheng Yu, Fan Xia, Weining Qian, Aoying Zhou, Jianlong Chang:
On efficiently generating realistic social media timeline structures. 45:1-45:4
Demo papers
- Jiuqiang Chen, Sarah Cohen Boulakia, Christine Froidevaux, Carole A. Goble, Paolo Missier, Alan R. Williams:
DistillFlow: removing redundancy in scientific workflows. 46:1-46:4 - Ilias Kanellos, Thanasis Vergoulis, Dimitris Sacharidis, Theodore Dalamagas, Artemis G. Hatzigeorgiou, Stelios Sartzetakis, Timos K. Sellis:
MR-microT: a MapReduce-based MicroRNA target prediction method. 47:1-47:4 - Kasper Grud Skat Madsen, Philip Thyssen, Yongluan Zhou:
Integrating fault-tolerance and elasticity in a distributed data stream processing system. 48:1-48:4 - Peter Reimann, Holger Schwarz:
Simulation workflow design tailor-made for scientists. 49:1-49:4 - Chongsheng Zhang:
A system for efficient and simultaneous processing of moving K nearest neighbor and spatial keyword queries. 50:1-50:4
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.
last updated on 2025-10-26 23:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
