Table of Contents

• Data warehouse testingNeveen ElGamal, Ali ElBastawissy, Galal H. Galal-Edeen. 1-8 [doi]
• A declarative approach to customize workflow provenanceSaumen C. Dey, Bertram Ludäscher. 9-16 [doi]
• Multidimensional process mining: a flexible analysis approach for health services researchThomas Vogelgesang, Hans-Jürgen Appelrath. 17-22 [doi]
• Towards efficient and practical solutions for ontology-based data managementValerio Santarelli, Domenico Lembo. 23-30 [doi]
• Database support for processing complex aggregate queries over data streamsYuanzhen Ji. 31-37 [doi]
• Discovery querying in linked open dataStefan Hagedorn, Kai-Uwe Sattler. 38-44 [doi]
• Mining irregularities in maritime container itinerariesMuriel Pellissier, Hervé Martin, Evangelos Kotsakis. 45-51 [doi]
• Assessing linkset quality for complementing third-party datasetsRiccardo Albertoni, Asunción Gómez-Pérez. 52-59 [doi]
• Structure inference for linked data sources using clusteringKlitos Christodoulou, Norman W. Paton, Alvaro A. A. Fernandes. 60-67 [doi]
• Improving geo-spatial linked data with the wisdom of the crowdsRoula Karam, Michele Melchiori. 68-74 [doi]
• Linked data classification: a feature-based approachAlfio Ferrara, Lorenzo Genta, Stefano Montanelli. 75-82 [doi]
• Semantic question answering system over linked data using relational patternsSherzod Hakimov, Hakan Tunc, Marlen Akimaliev, Erdogan Dogdu. 83-88 [doi]
• LOVER: support for modeling data using linked open vocabulariesJohann Schaible, Thomas Gottron, Stefan Scheglmann, Ansgar Scherp. 89-92 [doi]
• Community evolution detection in time-evolving information networksAlfredo Cuzzocrea, Francesco Folino. 93-96 [doi]
• Supporting range queries in XML keyword searchYong Zeng, Zhifeng Bao, Tok Wang Ling. 97-104 [doi]
• A flexible framework for context-aware recommendations in the social commerce domainDavide Ronca, Armando Calvanese, Cosimo Birtolo. 105-110 [doi]
• Efficient tree pattern queries on encrypted XML documentsJianneng Cao, Fang-Yu Rao, Mehmet Kuzu, Elisa Bertino, Murat Kantarcioglu. 111-120 [doi]
• Design and implementation of privacy-preserving reconciliation protocolsGeorg Neugebauer, Lucas Brutschy, Ulrike Meyer, Susanne Wetzel. 121-130 [doi]
• A privacy framework: indistinguishable privacyJinfei Liu, Li Xiong, Jun Luo. 131-136 [doi]
• A theoretical model for obfuscating web navigation trailsFida Kamal Dankar, Khaled El Emam. 137-144 [doi]
• Anonymizing sequential releases under arbitrary updatesAdeel Anjum, Guillaume Raschia. 145-154 [doi]
• Secure multiparty aggregation with differential privacy: a comparative studySlawomir Goryczka, Li Xiong, Vaidy S. Sunderam. 155-163 [doi]
• Monitoring and recommending privacy settings in social networksKambiz Ghazinour, Stan Matwin, Marina Sokolova. 164-168 [doi]
• Biometric access control for e-health records in pre-hospital careJosé R. Díaz-Palacios, Víctor J. Romo-Aledo, Amir H. Chinaei. 169-173 [doi]
• A privacy preserving model bridging data provider and collector preferencesKambiz Ghazinour, Ken Barker. 174-178 [doi]
• A trustworthy database for privacy-preserving video surveillanceAntoni Martínez-Ballesté, Hatem A. Rashwan, Jordi Castellà-Roca, Domènec Puig. 179-183 [doi]
• What we talk about when we talk about graphsGeorge H. L. Fletcher. 184 [doi]
• Towards query model integration: topology-aware, IR-inspired metrics for declarative graph queryingLuiz Gomes Jr., Rodrigo Jensen, André Santanchè. 185-194 [doi]
• Performance of graph query languages: comparison of cypher, gremlin and native access in Neo4jFlorian Holzschuher, René Peinl. 195-204 [doi]
• A similarity measure for approximate querying over RDF dataRoberto De Virgilio, Antonio Maccioni, Riccardo Torlone. 205-213 [doi]
• On implementing provenance-aware regular path queries with relational query enginesSaumen C. Dey, Víctor Cuevas-Vicenttín, Sven Köhler 0003, Eric Gribkoff, Michael Wang, Bertram Ludäscher. 214-223 [doi]
• Dynamic multi-version ontology-based personalizationFabio Grandi. 224-232 [doi]
• Finding nearest neighbors in road networks: a tree decomposition methodFang Wei-Kleiner. 233-240 [doi]
• Symbolic representation of smart meter dataTri Kurniawan Wijaya, Julien Eberle, Karl Aberer. 242-248 [doi]
• Visualizing complex energy planning objects with inherent flexibilitiesLaurynas Siksnys, Dalia Kaulakiene. 249-255 [doi]
• Towards ontological foundations of knowledge related to the emissions trading systemUmberto Ciorba, Antonio De Nicola 0001, Stefano La Malfa, Tiziano Pignatelli, Vittorio Rosato, Maria Luisa Villani. 256-261 [doi]
• Optimized renewable energy forecasting in local distribution networksRobert Ulbricht, Ulrike Fischer, Wolfgang Lehner, Hilko Donker. 262-266 [doi]
• Towards the automated extraction of flexibilities from electricity time seriesDalia Kaulakiene, Laurynas Siksnys, Yoann Pitarch. 267-272 [doi]
• Research challenges for energy data management (panel)Torben Bach Pedersen, Wolfgang Lehner. 273-274 [doi]
• Towards design support for provenance awareness: a classification of provenance questionsParaskevi Zerva, Steffen Zschaler, Simon Miles. 275-281 [doi]
• Capturing and querying workflow runtime provenance with PROV: a practical approachFlavio Costa, Vítor Silva, Daniel de Oliveira, Kary A. C. S. Ocaña, Eduardo S. Ogasawara, Jonas Dias, Marta Mattoso. 282-289 [doi]
• Provenance from log files: a BigData problemDevarshi Ghoshal, Beth Plale. 290-297 [doi]
• WebLab PROV: computing fine-grained provenance links for XML artifactsBernd Amann, Camélia Constantin, Clément Caron, Patrick Giroux. 298-306 [doi]
• Provenance for seismological processing pipelines in a distributed streaming workflowAlessandro Spinuso, James Cheney, Malcolm P. Atkinson. 307-312 [doi]
• Enhancing and abstracting scientific workflow provenance for data publishingPinar Alper, Khalid Belhajjame, Carole A. Goble, Pinar Karagoz. 313-318 [doi]
• Using provenance to analyse agent-based simulationsEdoardo Pignotti, Gary Polhill, Peter Edwards. 319-322 [doi]
• VisTrails provenance traces for benchmarkingFernando Seabra Chirigati, Juliana Freire, David Koop, Cláudio T. Silva. 323-324 [doi]
• Provenance traces of the swift parallel scripting systemLuiz M. R. Gadelha Jr., Michael Wilde, Marta Mattoso, Ian T. Foster. 325-326 [doi]
• Extracting PROV provenance traces from Wikipedia history pagesPaolo Missier, Ziyu Chen. 327-330 [doi]
• A workflow PROV-corpus based on taverna and wingsKhalid Belhajjame, Jun Zhao, Daniel Garijo, Aleix Garrido, Stian Soiland-Reyes, Pinar Alper, Óscar Corcho. 331-332 [doi]
• PROV-O provenance traces from agent-based social simulationEdoardo Pignotti, Gary Polhill, Peter Edwards. 333-334 [doi]
• Cross-platform provenanceAshish Gehani, Dawood Tariq. 335-336 [doi]
• Provenance traces from Chiron parallel workflow engineFelipe Horta, Vítor Silva, Flavio Costa, Daniel de Oliveira, Kary A. C. S. Ocaña, Eduardo S. Ogasawara, Jonas Dias, Marta Mattoso. 337-338 [doi]
• Provenance in streamflow forecastingHeiko Müller, Chris Peters, Yanfeng Shu, Andrew Terhorst. 339-340 [doi]
• Efficient parallel partition-based algorithms for similarity search and join with edit distance constraintsYu Jiang, Dong Deng, Jiannan Wang, Guoliang Li, Jianhua Feng. 341-348 [doi]
• Trying to outperform a well-known index with a sequential scanJan Hentschel, Thomas Meyer, Thomas Rommel. 349-356 [doi]
• Efficient high-similarity string comparison: the waterfall algorithmAlexander Tiskin. 358-365 [doi]
• WallBreaker: overcoming the wall effect in similarity searchStefan Gerdjikov, Stoyan Mihov, Petar Mitankin, Klaus U. Schulz. 366-369 [doi]
• Scalable string similarity search/join with approximate seeds and multiple backtrackingEnrico Siragusa, David Weese, Knut Reinert. 370-374 [doi]
• Efficient edit distance based string similarity search using deletion neighborhoodsShashwat Mishra, Tejas Gandhi, Akhil Arora, Arnab Bhattacharya 0001. 375-383 [doi]
• Approximate string matching by position restricted alignmentManish Patil, Xuanting Cai, Sharma V. Thankachan, Rahul Shah, Seung-Jong Park, David Foltz. 384-391 [doi]
• Trie-based similarity search and joinJianbin Qin, Xiaoling Zhou, Wei Wang 0011, Chuan Xiao. 392-396 [doi]
• FPI: a novel indexing method using frequent patterns for approximate string searchesMitsuki Kimura, Atsuhiro Takasu, Jun Adachi. 397-403 [doi]
• Cache-aware parallel approximate matching and join algorithms using BWTJiaying Wang, Xiaochun Yang, Bin Wang. 404-412 [doi]