Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems
Author: Richard Hull
Publisher:
Published: 2014
Total Pages: 290
ISBN-13: 9781450323758
DOWNLOAD EBOOKPosts
Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems
Author:
Publisher:
Published: 2001
Total Pages: 316
ISBN-13:
DOWNLOAD EBOOKDatabase Systems for Advanced Applications
Author: Selçuk Candan
Publisher: Springer
Published: 2017-03-20
Total Pages: 693
ISBN-13: 3319556991
DOWNLOAD EBOOKThis two volume set LNCS 10177 and 10178 constitutes the refereed proceedings of the 22nd International Conference on Database Systems for Advanced Applications, DASFAA 2017, held in Suzhou, China, in March 2017. The 73 full papers, 9 industry papers, 4 demo papers and 3 tutorials were carefully selected from a total of 300 submissions. The papers are organized around the following topics: semantic web and knowledge management; indexing and distributed systems; network embedding; trajectory and time series data processing; data mining; query processing and optimization; text mining; recommendation; security, privacy, senor and cloud; social network analytics; map matching and spatial keywords; query processing and optimization; search and information retrieval; string and sequence processing; stream date processing; graph and network data processing; spatial databases; real time data processing; big data; social networks and graphs.
Algorithms, Probability, Networks, and Games
Author: Christos Zaroliagis
Publisher: Springer
Published: 2015-09-07
Total Pages: 418
ISBN-13: 3319240242
DOWNLOAD EBOOKThis Festschrift volume is published in honor of Professor Paul G. Spirakis on the occasion of his 60th birthday. It celebrates his significant contributions to computer science as an eminent, talented, and influential researcher and most visionary thought leader, with a great talent in inspiring and guiding young researchers. The book is a reflection of his main research activities in the fields of algorithms, probability, networks, and games, and contains a biographical sketch as well as essays and research contributions from close collaborators and former PhD students.
Web and Big Data
Author: Jie Shao
Publisher: Springer
Published: 2019-07-25
Total Pages: 446
ISBN-13: 3030260720
DOWNLOAD EBOOKThis two-volume set, LNCS 11641 and 11642, constitutes the thoroughly refereed proceedings of the Third International Joint Conference, APWeb-WAIM 2019, held in Chengdu, China, in August 2019. The 42 full papers presented together with 17 short papers, and 6 demonstration papers were carefully reviewed and selected from 180 submissions. The papers are organized around the following topics: Big Data Analytics; Data and Information Quality; Data Mining and Application; Graph Data and Social Networks; Information Extraction and Retrieval; Knowledge Graph; Machine Learning; Recommender Systems; Storage, Indexing and Physical Database Design; Spatial, Temporal and Multimedia Databases; Text Analysis and Mining; and Demo.
Study on Data Placement Strategies in Distributed RDF Stores
Author: D.D. Janke
Publisher: IOS Press
Published: 2020-03-18
Total Pages: 312
ISBN-13: 1643680692
DOWNLOAD EBOOKThe distributed setting of RDF stores in the cloud poses many challenges, including how to optimize data placement on the compute nodes to improve query performance. In this book, a novel benchmarking methodology is developed for data placement strategies; one that overcomes these limitations by using a data-placement-strategy-independent distributed RDF store to analyze the effect of the data placement strategies on query performance. Frequently used data placement strategies have been evaluated, and this evaluation challenges the commonly held belief that data placement strategies which emphasize local computation lead to faster query executions. Indeed, results indicate that queries with a high workload can be executed faster on hash-based data placement strategies than on, for example, minimal edge-cut covers. The analysis of additional measurements indicates that vertical parallelization (i.e., a well-distributed workload) may be more important than horizontal containment (i.e., minimal data transport) for efficient query processing. Two such data placement strategies are proposed: the first, found in the literature, is entitled overpartitioned minimal edge-cut cover, and the second is the newly developed molecule hash cover. Evaluation revealed a balanced query workload and a high horizontal containment, which lead to a high vertical parallelization. As a result, these strategies demonstrated better query performance than other frequently used data placement strategies. The book also tests the hypothesis that collocating small connected triple sets on the same compute node while balancing the amount of triples stored on the different compute nodes leads to a high vertical parallelization.
Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering
Author: Jeff Z. Pan
Publisher: Springer
Published: 2017-02-28
Total Pages: 271
ISBN-13: 3319494937
DOWNLOAD EBOOKThis volume contains some lecture notes of the 12th Reasoning Web Summer School (RW 2016), held in Aberdeen, UK, in September 2016. In 2016, the theme of the school was “Logical Foundation of Knowledge Graph Construction and Query Answering”. The notion of knowledge graph has become popular since Google started to use it to improve its search engine in 2012. Inspired by the success of Google, knowledge graphs are gaining momentum in the World Wide Web arena. Recent years have witnessed increasing industrial take-ups by other Internet giants, including Facebook's Open Graph and Microsoft's Satori. The aim of the lecture note is to provide a logical foundation for constructing and querying knowledge graphs. Our journey starts from the introduction of Knowledge Graph as well as its history, and the construction of knowledge graphs by considering both explicit and implicit author intentions. The book will then cover various topics, including how to revise and reuse ontologies (schema of knowledge graphs) in a safe way, how to combine navigational queries with basic pattern matching queries for knowledge graph, how to setup a environment to do experiments on knowledge graphs, how to deal with inconsistencies and fuzziness in ontologies and knowledge graphs, and how to combine machine learning and machine reasoning for knowledge graphs.
Database Systems For Advanced Applications '97 - Proceedings Of The 5th International Conference On Database Systems For Advanced Applications
Author: Rodney Topor
Publisher: World Scientific
Published: 1997-03-15
Total Pages: 562
ISBN-13: 9814497487
DOWNLOAD EBOOKThis volume contains the proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA '97). DASFAA '97 focused on advanced database technologies and their applications. The 55 papers in this volume cover a wide range of areas in the field of database systems and applications - including the rapidly emerging areas of the Internet, multimedia, and document database systems - and should be of great interest to all database system researchers and developers, and practitioners.
Probabilistic Databases
Author: Dan Suciu
Publisher: Morgan & Claypool Publishers
Published: 2011
Total Pages: 183
ISBN-13: 1608456803
DOWNLOAD EBOOKProbabilistic databases are databases where the value of some attributes or the presence of some records are uncertain and known only with some probability. Applications in many areas such as information extraction, RFID and scientific data management, data cleaning, data integration, and financial risk assessment produce large volumes of uncertain data, which are best modeled and processed by a probabilistic database. This book presents the state of the art in representation formalisms and query processing techniques for probabilistic data. It starts by discussing the basic principles for representing large probabilistic databases, by decomposing them into tuple-independent tables, block-independent-disjoint tables, or U-databases. Then it discusses two classes of techniques for query evaluation on probabilistic databases. In extensional query evaluation, the entire probabilistic inference can be pushed into the database engine and, therefore, processed as effectively as the evaluation of standard SQL queries. The relational queries that can be evaluated this way are called safe queries. In intensional query evaluation, the probabilistic inference is performed over a propositional formula called lineage expression: every relational query can be evaluated this way, but the data complexity dramatically depends on the query being evaluated, and can be #P-hard. The book also discusses some advanced topics in probabilistic data management such as top-k query processing, sequential probabilistic databases, indexing and materialized views, and Monte Carlo databases. Table of Contents: Overview / Data and Query Model / The Query Evaluation Problem / Extensional Query Evaluation / Intensional Query Evaluation / Advanced Techniques
Approximation and Online Algorithms
Author: Evripidis Bampis
Publisher: Springer Nature
Published: 2020-01-24
Total Pages: 264
ISBN-13: 3030394794
DOWNLOAD EBOOKThis book constitutes the thoroughly refereed workshop post-proceedings of the 17th International Workshop on Approximation and Online Algorithms, WAOA 2019, held in Munich, Germany, in September 2019 as part of ALGO 2019. The 16 revised full papers presented together with one invited paper in this book were carefully reviewed and selected from 38 submissions. Topics of interest for WAOA 2018 were: graph algorithms; inapproximability results; network design; packing and covering; paradigms for the design and analysis of approximation and online algorithms; parameterized complexity; scheduling problems; algorithmic game theory; algorithmic trading; coloring and partitioning; competitive analysis; computational advertising; computational finance; cuts and connectivity; geometric problems; mechanism design; resource augmentation; and real-world applications.
