Databases / Data management Books

Book SynopsisThis book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.Table of ContentsKeynotes.- Algorithmic Challenges in Web Search Engines.- RNA Molecules: Glimpses Through an Algorithmic Lens.- Squares.- Matching Based Augmentations for Approximating Connectivity Problems.- Modelling Errors and Recovery for Communication.- Lossless Data Compression Via Error Correction.- The Power and Weakness of Randomness in Computation.- Regular Contributions.- A New GCD Algorithm for Quadratic Number Rings with Unique Factorization.- On Clusters in Markov Chains.- An Architecture for Provably Secure Computation.- Scoring Matrices That Induce Metrics on Sequences.- Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.- The Complexity of Diffuse Reflections in a Simple Polygon.- Counting Proportions of Sets: Expressive Power with Almost Order.- Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets.- Relations Among Notions of Security for Identity Based Encryption Schemes.- Optimally Adaptive Integration of Univariate Lipschitz Functions.- Classical Computability and Fuzzy Turing Machines.- An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees.- An Algorithm for a Generalized Maximum Subsequence Problem.- Random Bichromatic Matchings.- Eliminating Cycles in the Discrete Torus.- On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions.- Pattern Matching Statistics on Correlated Sources.- Robust Model-Checking of Linear-Time Properties in Timed Automata.- The Computational Complexity of the Parallel Knock-Out Problem.- Reconfigurations in Graphs and Grids.- -Varieties, Actions and Wreath Product.- Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.- An Efficient Approximation Algorithm for Point Pattern Matching Under Noise.- Oblivious Medians Via Online Bidding.- Efficient Computation of the Relative Entropy of Probabilistic Automata.- A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences.- De Dictionariis Dynamicis Pauco Spatio Utentibus.- Customized Newspaper Broadcast: Data Broadcast with Dependencies.- On Minimum k-Modal Partitions of Permutations.- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.- Maximizing Throughput in Queueing Networks with Limited Flexibility.- Network Flow Spanners.- Finding All Minimal Infrequent Multi-dimensional Intervals.- Cut Problems in Graphs with a Budget Constraint.- Lower Bounds for Clear Transmissions in Radio Networks.- Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.- Lower Bounds for Geometric Diameter Problems.- Connected Treewidth and Connected Graph Searching.- A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs.- The Committee Decision Problem.- Common Deadline Lazy Bureaucrat Scheduling Revisited.- Approximate Sorting.- Stochastic Covering and Adaptivity.- Algorithms for Modular Counting of Roots of Multivariate Polynomials.- Hardness Amplification Via Space-Efficient Direct Products.- The Online Freeze-Tag Problem.- I/O-Efficient Algorithms on Near-Planar Graphs.- Minimal Split Completions of Graphs.- Design and Analysis of Online Batching Systems.- Competitive Analysis of Scheduling Algorithms for Aggregated Links.- A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains.- On Sampling in Higher-Dimensional Peer-to-Peer Systems.- Mobile Agent Rendezvous in a Synchronous Torus.- Randomly Colouring Graphs with Girth Five and Large Maximum Degree.- Packing Dicycle Covers in Planar Graphs with No K 5–e Minor.- Sharp Estimates for the Main Parameters of the Euclid Algorithm.- Position-Restricted Substring Searching.- Rectilinear Approximation of a Set of Points in the Plane.- The Branch-Width of Circular-Arc Graphs.- Minimal Eulerian Circuit in a Labeled Digraph.- Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization.- RISOTTO: Fast Extraction of Motifs with Mismatches.- Minimum Cost Source Location Problems with Flow Requirements.- Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms.- Constructions of Approximately Mutually Unbiased Bases.- Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In.

Read more less

Book SynopsisThe workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA’95 in Hagen, Germany, CCA’96 in Trier, Germany, and CCA’98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a cro- section through recent research on computability and complexity in analysis. The workshop succeeded in bringing together people interested in computability and complexity aspects of analysis and in exploring connections with nume- cal methods, physics and, of course, computer science. It was rounded o by a number of talks and papers on exact computer arithmetic and by a competition of v e implemented systems. A report on this competition has been included in these proceedings. We would like to thank the authors for their contributions and the referees for their careful work, and we hope for further inspiring and constructive meetings of the same kind. April 2001 Jens Blanck Vasco Brattka Peter Hertling Organization CCA2000was hosted by the Department of Computer Science of the University of Wales Swansea and took place on September 17{19, 2000.Table of ContentsComputability and Complexity in Analysis.- Effectivity of Regular Spaces.- The Degree of Unsolvability of a Real Number.- A Survey of Exact Arithmetic Implementations.- Standard Representations of Effective Metric Spaces.- Banach-Mazur Computable Functions on Metric Spaces.- A Generic Root Operation for Exact Real Arithmetic.- Effective Contraction Theorem and Its Application.- Polynomially Time Computable Functions over p-Adic Fields.- On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theorems.- Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory.- Computing a Required Absolute Precision from a Stream of Linear Fractional Transformations.- ?-Approximable Functions.- Computabilities of Fine-Continuous Functions.- The iRRAM: Exact Arithmetic in C++.- The Uniformity Conjecture.- Admissible Representations of Limit Spaces.- Characterization of the Computable Real Numbers by Means of Primitive Recursive Functions.- Effective Fixed Point Theorem over a Non-Computably Separable Metric Space.- Computational Dimension of Topological Spaces.- Some Properties of the Effective Uniform Topological Space.- On Computable Metric Spaces Tietze-Urysohn Extension Is Computable.- Is the Linear Schrödinger Propagator Turing Computable?.- A Computable Spectral Theorem.- Report on Competition.- Exact Real Arithmetic Systems: Results of Competition.

Read more less

Book SynopsisFormanyyearstheintersectionofcomputing anddataanalysiscontainedme- based statistics packages and not much else. Recently, statisticians have - braced computing, computer scientists have started using statistical theories and methods, and researchers in all corners have invented algorithms to nd structure in vast online datasets. Data analysts now have access to tools for exploratory data analysis, decision tree induction, causal induction, function - timation,constructingcustomizedreferencedistributions,andvisualization,and thereareintelligentassistantsto adviseonmatters ofdesignandanalysis.There aretoolsfortraditional,relativelysmallsamples,andalsoforenormousdatasets. In all, the scope for probing data in new and penetrating ways has never been so exciting. The IDA-99 conference brings together a wide variety of researchers c- cerned with extracting knowledge from data, including people from statistics, machine learning, neural networks, computer science, pattern recognition, da- base management, and other areas.The strategiesadopted by people from these areas are often di erent, and a synergy results if this is recognized. The IDA series of conferences is intended to stimulate interaction between these di erent areas,sothatmorepowerfultoolsemergeforextractingknowledgefromdataand a better understanding is developed of the process of intelligent data analysis. The result is a conference that has a clear focus (one application area:intelligent data analysis) and a broad scope (many di erent methods and techniques).Table of ContentsLearning.- From Theoretical Learnability to Statistical Measures of the Learnable.- ALM: A Methodology for Designing Accurate Linguistic Models for Intelligent Data Analysis.- A “Top-Down and Prune” Induction Scheme for Constrained Decision Committees.- Mining Clusters with Association Rules.- Evolutionary Computation to Search for Strongly Correlated Variables in High-Dimensional Time-Series.- The Biases of Decision Tree Pruning Strategies.- Feature Selection as Retrospective Pruning in Hierarchical Clustering.- Discriminative Power of Input Features in a Fuzzy Model.- Learning Elements of Representations for Redescribing Robot Experiences.- “Seeing“ Objects in Spatial Datasets.- Intelligent Monitoring Method Using Time Varying Binomial Distribution Models for Pseudo-Periodic Communication Traffic.- Visualization.- Monitoring Human Information Processing via Intelligent Data Analysis of EEG Recordings.- Knowledge-Based Visualization to Support Spatial Data Mining.- Probabilistic Topic Maps: Navigating through Large Text Collections.- 3D Grand Tour for Multidimensional Data and Clusters.- Classification and Clustering.- A Decision Tree Algorithm for Ordinal Classification.- Discovering Dynamics Using Bayesian Clustering.- Integrating Declarative Knowledge in Hierarchical Clustering Tasks.- Nonparametric Linear Discriminant Analysis by Recursive Optimization with Random Initialization.- Supervised Classification Problems: How to Be Both Judge and Jury.- Temporal Pattern Generation Using Hidden Markov Model Based Unsupervised Classification.- Exploiting Similarity for Supporting Data Analysis and Problem Solving.- Multiple Prototype Model for Fuzzy Clustering.- A Comparison of Genetic Programming Variants for Data Classification.- Fuzzy Clustering Based on Modified Distance Measures.- Building Classes in Object-Based Languages by Automatic Clustering.- Integration.- Adjusted Estimation for the Combination of Classifiers.- Data-Driven Theory Refinement Using KBDistAl.- Reasoning about Input-Output Modeling of Dynamical Systems.- Undoing Statistical Advice.- A Method for Temporal Knowledge Conversion.- Applications.- Intrusion Detection through Behavioral Data.- Bayesian Neural Network Learning for Prediction in the Australian Dairy Industry.- Exploiting Sample-Data Distributions to Reduce the Cost of Nearest-Neighbor Searches with Kd-Trees.- Pump Failure Detection Using Support Vector Data Descriptions.- Data Mining for the Detection of Turning Points in Financial Time Series.- Computer-Assisted Classification of Legal Abstracts.- Sequential Control Logic Inferring Method from Observed Plant I/O Data.- Evaluating an Eye Screening Test.- Application of Rough Sets Algorithms to Prediction of Aircraft Component Failure.- Media Mining.- Exploiting Structural Information for Text Classification on the WWW.- Multi-agent Web Information Retrieval: Neural Network Based Approach.- Adaptive Information Filtering Algorithms.- A Conceptual Graph Approach for Video Data Representation and Retrieval.

Read more less

Book SynopsisData matching (also known as record or data linkage, entity resolution, object identification, or field matching) is the task of identifying, matching and merging records that correspond to the same entities from several databases or even within one database. Based on research in various domains including applied statistics, health informatics, data mining, machine learning, artificial intelligence, database management, and digital libraries, significant advances have been achieved over the last decade in all aspects of the data matching process, especially on how to improve the accuracy of data matching, and its scalability to large databases.Peter Christen’s book is divided into three parts: Part I, “Overview”, introduces the subject by presenting several sample applications and their special challenges, as well as a general overview of a generic data matching process. Part II, “Steps of the Data Matching Process”, then details its main steps like pre-processing, indexing, field and record comparison, classification, and quality evaluation. Lastly, part III, “Further Topics”, deals with specific aspects like privacy, real-time matching, or matching unstructured data. Finally, it briefly describes the main features of many research and open source systems available today.By providing the reader with a broad range of data matching concepts and techniques and touching on all aspects of the data matching process, this book helps researchers as well as students specializing in data quality or data matching aspects to familiarize themselves with recent research advances and to identify open research challenges in the area of data matching. To this end, each chapter of the book includes a final section that provides pointers to further background and research material. Practitioners will better understand the current state of the art in data matching as well as the internal workings and limitations of current systems. Especially, they will learn that it is often not feasible to simply implement an existing off-the-shelf data matching system without substantial adaption and customization. Such practical considerations are discussed for each of the major steps in the data matching process.Trade Review"The book is very well organized and exceptionally well written. Because of the depth, amount, and quality of the material that is covered, I would expect this book to be one of the standard references in future years." William E. Winkler, U.S. Bureau of the Census, Washington, DC, USATable of ContentsPart I Overview.- Introduction.- The Data Matching Process.- Part II Steps of the Data Matching Process.- Data Pre-Processing.- Indexing.- Field and Record Comparison.- Classification.- Evaluation of Matching Quality and Complexity.- Part III Further Topics.- Privacy Aspects of Data Matching.- Further Topics and Research Directions.- Data Matching Systems.

Read more less

Book SynopsisRecent achievements in hardware and software development, such as multi-core CPUs and DRAM capacities of multiple terabytes per server, enabled the introduction of a revolutionary technology: in-memory data management. This technology supports the flexible and extremely fast analysis of massive amounts of enterprise data. Professor Hasso Plattner and his research group at the Hasso Plattner Institute in Potsdam, Germany, have been investigating and teaching the corresponding concepts and their adoption in the software industry for years.This book is based on an online course that was first launched in autumn 2012 with more than 13,000 enrolled students and marked the successful starting point of the openHPI e-learning platform. The course is mainly designed for students of computer science, software engineering, and IT related subjects, but addresses business experts, software developers, technology experts, and IT analysts alike. Plattner and his group focus on exploring the inner mechanics of a column-oriented dictionary-encoded in-memory database. Covered topics include - amongst others - physical data storage and access, basic database operators, compression mechanisms, and parallel join algorithms. Beyond that, implications for future enterprise applications and their development are discussed. Step by step, readers will understand the radical differences and advantages of the new technology over traditional row-oriented, disk-based databases.In this completely revised 2nd edition, we incorporate the feedback of thousands of course participants on openHPI and take into account latest advancements in hard- and software. Improved figures, explanations, and examples further ease the understanding of the concepts presented. We introduce advanced data management techniques such as transparent aggregate caches and provide new showcases that demonstrate the potential of in-memory databases for two diverse industries: retail and life sciences. Table of ContentsIntroduction.- Part I: The Future of Enterprise Computing.- Part II: Foundations of Database Storage Techniques.- Part III: In-Memory Database Operators.- Part IV: Advanced Database Storage Techniques.- Part V: Principles for Enterprise Application Development.- Self Test Solutions.

Read more less

Book SynopsisDie Potentiale und Risiken der Datenökonomie sind Gegenstand anhaltender Kontroversen. Zur Untersuchung dieser Kontroversen wird eine wissenssoziologische Diskursanalyse von Diskursdaten im Zeitraum von 2010 bis 2020 durchgeführt. Die Ergebnisse zeigen eine Demokratisierung der Technologieentwicklung durch die Austragung von Kontroversen im öffentlichen Diskurs sowie in politisch eingerichteten „hybriden Foren“. Die Arbeit erweitert die Forschung über die Kontroversen und kollektiven Wissensprozesse in der Datenökonomie. Table of ContentsEinleitung.- Literatur zu Technologiediskursen.- Methodik.- Analyse.- Modell der kollektiven Wissensproduktion in kontroversen Technologieentwicklungsprozessen.- Diskussion der Ergebnisse und Beiträge zur Forschung.- Limitationen der Arbeit und zukünftige Forschung.- Schlussfolgerung und Ausblick.- Literaturverzeichnis

Read more less

Book SynopsisThe LNCS journal Transactions on Large-Scale Data- and Knowledge-Centered Systems focuses on data management, knowledge discovery, and knowledge processing, which are core and hot topics in computer science. Since the 1990s, the Internet has become the main driving force behind application development in all domains. An increase in the demand for resource sharing (e.g., computing resources, services, metadata, data sources) across different sites connected through networks has led to an evolution of data- and knowledge-management systems from centralized systems to decentralized systems enabling large-scale distributed applications providing high scalability. This, the 45th issue of Transactions on Large-Scale Data- and Knowledge-Centered Systems, contains eight revised selected regular papers. Topics covered include data analysis, information extraction, blockchains, and big data.Table of ContentsInteroperable Data Extraction and Analytics Queries over Blockchains.- Exploiting Twitter for Informativeness Classification in Disaster Situations.- COTILES: Leveraging Content and Structure for Evolutionary Community Detection.- A Weighted Feature-Based Image Quality Assessment Framework in Real-Time.- Sharing Knowledge in Digital Ecosystems Using Semantic Multimedia Big Data.- Facilitating and Managing Machine Learning and Data Analysis Tasks in Big Data Environments Using Web and Microservice Technologies.- Stable Marriage Matching for Homogenizing Load Distribution in a Cloud Data Center.- A Sentiment Analysis Software Framework for the Support of Business Information Architecture in the Tourist Sector

Read more less

Book SynopsisThis textbook provides an easy-to-understand introduction to the mathematical concepts and algorithms at the foundation of data science. It covers essential parts of data organization, descriptive and inferential statistics, probability theory, and machine learning. These topics are presented in a clear and mathematical sound way to help readers gain a deep and fundamental understanding. Numerous application examples based on real data are included. The book is well-suited for lecturers and students at technical universities, and offers a good introduction and overview for people who are new to the subject. Basic mathematical knowledge of calculus and linear algebra is required.Table of Contents

Read more less

Book Synopsis.- KGMA Workshop..- Approximating Temporal Katz Centrality with Methods..- LLM for Uniform Information Extraction using Multi-task Learning Optimization..- ASM: Adaptive Subgraph Matching via Efficient Compression and Label Filter..- SemiBDMA Workshop..- Learning Multi-Semantic Based on Cross-Attention for Image-Text Retrieval..- Integrated Global Semantics and Local Details for Image-text Retrieval..- Adversarial Graph Convolutional Network Hashing for Cross-Modal Retrieval..- FS-IGA: Feature Selection Method Based on Improved Genetic Algorithm..- Shearlet Transform Based Multiscale Fusion Network for Image Super Resolution..- Application of Segmental-based Transfinite Mapping Method for Quadrilateral Mesh Generation of Complex Domain..- Augmenting Knowledge Tracing: Personalized Modeling by Considering Forgetting Behavior in Learning Process..- A Time-Aware Sequential Recommendation based on Attention Mechanism..- Integrating User Sentiment and Behavior for Explainable Recommendation..- MADM Workshop..- SACC: Secure-cooperative Adaptive Cruise Control for Unmanned Vehicles..- A Systematic Mapping Study of LLM Applications in Mobile Device Research..- Application Framework for OpenHarmony Distributed Trusted Execution Environment..- Design and Implementation of a Multi-metric Performance Analysis Tool for Android System and its Applications..- Towards Optimal Leakage Assessment of TVLA..- Joint UAV Trajectory Optimization and Task Offloading in Integrated Air-Ground Networks..- AIEDM Workshop..- Research on Ethical Issues of Classroom Dialogue in the Era of Large Language Model..- Adaptive Exploration: Elevating Educational Impact of Unsupervised Knowledge Graph Question Answering..- xLSTM-FER: Enhancing Student Expression Recognition with Extended Vision Long Short-Term Memory Network..- RDNeRF: Radiance Distribution Guided NeRF for Floaters Removing..- Multi-User VR Content Wireless Delivery using Motion Prediction and Adaptive Multicasting..- MEGKT:Multi-Edge Features Enhancement for Graph-Based Knowledge Tracing..- STBDM Workshop..- Collaborative Inference for Adaptive DNN Pipeline-aware Alignment..- A Unified Framework for Link Prediction on Heterogeneous Temporal Graph..- Massive-Parallel Game of Politi..- Multiscale Convolutional Feature Aggregation for Finegrained Image Retrieval.

Read more less

Book SynopsisChapter 1 Study on marketing dynamics on sales of electric vehicles and swot analysis.- Chapter 2 Stability Analysis and Backward Bifurcation of Malaria Model.- Chapter 3 Mathematical model for diabetes using fuzzy parameters.- Chapter 4 Fuzzy iterated function systems.- Chapter 5 Introduction to Interval-valued Neutrosophic Hyper-soft Expert Set.- Chapter 6 Fuzzy Fractal Dimension of Covid-19 Variant Protein.- Chapter 7 A study of Intuitionistic Fuzzy Graph using Morphological operators and its application.- Chapter 8 Edge weight-based colouring and matching in inhomogeneous random graphs.- Chapter 9 Super Domination Number of Cycle based Graphs and Comb Product of Graphs.- Chapter 10 Sum Divisor Cordial Labelling for Middle Graph and Total Graph of Some Graphs.- Chapter 11 On the Core and Noncore vertices of Singular Graphs.- Chapter 12 On C-Perfection of Modular Product of Graphs.- Chapter 13 A study on topological indices of bipartite Kneser B type-1 graphs.- Chapter 14 On jumping graph grammars.- Chapter 15 Some eigen value properties of Uniform Hyperstar Using recurrence relation.- Chapter 16 A study On Ramanujan graphs.- Chapter 17 On the exponential Diophantine equation related To the powers of Cluster Primes.- Chapter 18 Structure of different categories of Diophantine 3-tuples ap-propriate (????,??)-centred polygonal numbers.- Chapter 19 A Birth-Death Process with Temporary Growth Halts and Population Independent Death Rate.- Chapter 20 Comparison of Vacation and Mt/Mt/1 Queueing Models for Traffic Flow at Signalized Intersections.- Chapter 21 Study of Birth-Death Processes with Growth Interruptions.

Read more less

Book SynopsisChapter 1 A Decision-making approaches for deconstruction operations optimization: a literature review.- Chapter 2 A Novel Optimization Model for Sustainable Life Cycle Design: Circular Economy Case Study in the Automotive Industry.- Chapter 3 Exploring Options for Designing an Optimal Circular Spent Coffee Grounds Reverse Logistics Network: An Optimization-based Approach.- Chapter 4 Optimizing Circular Economy: Simulation and optimisation in stochastic inventory control of perishable dairy products.- Chapter 5 Sustainability with 4R principle on multi-objective waste management under Fermatean fuzzy environment.- Chapter 6 Optimizing the MunicipalWaste Management to Support Circular Economy Program at Regency Level in Indonesia: Case Study in Banyumas Regency.- Chapter 7 The price and attitude to recycling: manufacturers and consumers points of view.- Chapter 8 Transition Pathway from Linear to Circular Economy in Waste Management in Indonesia: A study of two cities.- Chapter 9 Multicriteria Sustainability Index (MSI) in the Chico Mendes Extractive Reserve, in the state of Acre, Brazil.- Chapter 10 Plastics recycling dilemma: A value chain perspective on integrating mechanical and chemical recycling for closing the plastic loop.- Chapter 11 BCpbP - Blue Circular PostBranding Project, a local Portuguesecase study for a Blue Circular Economy.

Read more less

Book Synopsis"Chapter 1 Fundamentals of Distributed Systems".- "Chapter 2 Distributed Data Processing Language".- "Chapter 3 Distributed Query Processing".- "Chapter 4 Transaction Processing in a Distributed System".- "Chapter 5 Consistency of Distributed Data Services".- "Chapter 6 Case Study of Distributed Systems - GFS".- "Chapter 7 Go Language Fundamentals for Designing Distributed Systems".- "Chapter 8 Building a Strong Consistency Algorithm Library".- "Chapter 9 Building a Strong Consistent Distributed Key-Value Storage System".- "Chapter 10 Optimized Design and Implementation of the Strong Consistency Algorithm Raft: Multi-Raft".

Read more less