VLDB Endowment

Displaying 1-40 of 388 results

  • White Papers // Nov 2011

    PIQL: Success-Tolerant Query Processing in the Cloud

    Newly-released web applications often succumb to a "Success Disaster," where overloaded database machines and resulting high response times destroy a previously good user experience. Unfortunately, the data independence provided by a traditional relational database system, while useful for agile development, only exacerbates the problem by hiding potentially expensive queries under...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    A Framework for Supporting DBMS-Like Indexes in the Cloud

    To support "Database as a service" (DaaS) in the cloud, the database system is expected to provide similar functionalities as in centralized DBMS such as efficient processing of ad hoc queries. The system must therefore support DBMS-like indexes, possibly a few indexes for each table to provide fast location of...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    RemusDB: Transparent High Availability for Database Systems

    In this paper, the authors present a technique for building a High-Availability (HA) DataBase Management System (DBMS). The proposed technique can be applied to any DBMS with little or no customization, and with reasonable performance overhead. Their approach is based on Remus, a commodity HA solution implemented in the virtualization...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    DivDB: A System for Diversifying Query Results

    With the availability of very large databases, an exploratory query can easily lead to a vast answer set, typically based on an answer's relevance (i.e., top-k, tf-idf) to the user query. Navigating through such an answer set requires huge effort and users give up after perusing through the first few...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    Online Data Fusion

    The Web contains a significant volume of structured data in various domains, but a lot of data are dirty and erroneous, and they can be propagated through copying. While data integration techniques allow querying structured data on the Web, they take the union of the answers retrieved from different sources...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    Summary Graphs for Relational Database Schemas

    Increasingly complex databases need ever more sophisticated tools to help users understand their schemas and interact with the data. Existing tools fall short of either providing the "Big picture," or of presenting useful connectivity information. In this paper, the authors define summary graphs, a novel approach for summarizing schemas. Given...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    MapReduce Programming and Cost based Optimization? Crossing This Chasm With Starfish

    MapReduce has emerged as a viable competitor to database systems in big data analytics. MapReduce programs are being written for a wide variety of application domains including business data processing, text analysis, natural language processing, Web graph and social network analysis, and computational science. However, MapReduce systems lack a feature...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    Proactive Detection and Repair of Data Corruption: Towards a Hasslefree Declarative Approach With Amulet

    Occasional corruption of stored data is an unfortunate byproduct of the complexity of modern systems. Hardware errors, software bugs, and mistakes by human administrators can corrupt important sources of data. The dominant practice to deal with data corruption today involves administrators writing ad hoc scripts that run data-integrity tests at...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    Scalable SPARQL Querying of Large RDF Graphs

    The generation of RDF data has accelerated to the point where many data sets need to be partitioned across multiple machines in order to achieve reasonable performance when querying the data. Although tremendous progress has been made in the Semantic Web community for achieving high performance data management on a...

    Provided By VLDB Endowment

  • White Papers // Jul 2011

    Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data

    Given a query object q, a Reverse Nearest Neighbor (RNN) query in a common certain database returns the objects having q as their nearest neighbor. A new challenge for databases is dealing with uncertain objects. In this paper, the authors consider Probabilistic Reverse Nearest Neighbor (PRNN) queries, which return the...

    Provided By VLDB Endowment

  • White Papers // Jun 2011

    Monitoring Reverse Top-k Queries Over Mobile Devices

    Location-based queries are widely employed to retrieve useful information based on the user's geographical position. For example, a tourist that walks around a city may seek points of interest (e.g., restaurants) in her vicinity that satisfy her preferences (e.g., cheap and highly-rated). A top-k query defined by the user preferences...

    Provided By VLDB Endowment

  • White Papers // Apr 2011

    Albatross: Lightweight Elasticity in Shared Storage Databases for the Cloud Using Live Data Migration

    Database systems serving cloud platforms must serve large numbers of applications (or tenants). In addition to managing tenants with small data footprints, different schemas, and variable load patterns, such multitenant data platforms must minimize their operating costs by efficient resource sharing. When deployed over a pay-per-use infrastructure, elastic scaling and...

    Provided By VLDB Endowment

  • White Papers // Mar 2011

    Automatic Optimization for MapReduce Programs

    The MapReduce distributed programming framework has become popular, despite evidence that current implementations are inefficient, requiring far more hardware than traditional relational databases to complete similar tasks. MapReduce jobs are amenable to many traditional database query optimizations (B+Trees for selections, column-store-style techniques for projections, etc), but existing systems do not...

    Provided By VLDB Endowment

  • White Papers // Mar 2011

    CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads

    Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, the authors solve index tuning for large problem instances that are common in practice, e.g., thousands of queries in the workload, thousands of candidate indexes and several hard and...

    Provided By VLDB Endowment

  • White Papers // Feb 2011

    High Throughput Transaction Executions on Graphics Processors

    OLTP (On-Line Transaction Processing) is an important business system sector in various traditional and emerging online services. Due to the increasing number of users, OLTP systems require high throughput for executing tens of thousands of transactions in a short time period. Encouraged by the recent success of GPGPU (General-Purpose computation...

    Provided By VLDB Endowment

  • White Papers // Feb 2011

    Incrementally Maintaining Classification Using an RDBMS

    The proliferation of imprecise data has motivated both researchers and the database industry to push statistical techniques into Relational DataBase Management Systems (RDBMSes). The authors study strategies to maintain model-based views for a popular statistical technique, classification, inside an RDBMS in the presence of updates (to the set of training...

    Provided By VLDB Endowment

  • White Papers // Feb 2011

    Distributed Inference and Query Processing for RFID Tracking and Monitoring

    In this paper, the authors present the design of a scalable, distributed stream processing system for RFID tracking and monitoring. Since RFID data lacks containment and location information that is key to query processing, they propose to combine location and containment inference with stream query processing in a single architecture,...

    Provided By VLDB Endowment

  • White Papers // Feb 2011

    Fast Sparse MatrixVector Multiplication on GPUs: Implications for Graph Mining

    Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In this paper the authors present a novel non-parametric, self-tunable, approach to data representation for computing this kernel, particularly targeting sparse matrices representing power-law...

    Provided By VLDB Endowment

  • White Papers // Feb 2011

    Automatic Wrappers for Large Scale Web Extraction

    The authors present a generic framework to make wrapper induction algorithms tolerant to noise in the training data. This enables one to learn wrappers in a completely unsupervised manner from automatically and cheaply obtained noisy training data, e.g., using dictionaries and regular expressions. By removing the site-level supervision that wrapper-based...

    Provided By VLDB Endowment

  • White Papers // Jan 2011

    Graph Indexing of Road Networks for Shortest Path Queries With Label Restrictions

    The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. The authors introduce a new shortest path query type in which dynamic constraints may be placed on the allowable set of edges that can appear on a valid shortest...

    Provided By VLDB Endowment

  • White Papers // Nov 2010

    Efficient Processing of Top-k Spatial Preference Queries

    Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of location-based applications that rely on spatial preference queries, existing algorithms incur non-negligible processing cost resulting in high response time. The...

    Provided By VLDB Endowment

  • White Papers // Oct 2010

    ROXXI: Reviving Witness DOcuments to EXplore EXtracted Information

    In recent years, there has been considerable research on information extraction and constructing RDF knowledge bases. In general, the goal is to extract all relevant information from a corpus of documents, store it into an ontology, and answer future queries based only on the created knowledge base. Thus, the original...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    Read-Once Functions and Query Evaluation in Probabilistic Databases

    Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, query evaluation in probabilistic databases remains a computational challenge. Prior work on efficient exact query evaluation in probabilistic databases has largely concentrated on query-centric formulations (e.g.,...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    On Dense Pattern Mining in Graph Streams

    Many massive web and communication network applications create data which can be represented as a massive sequential stream of edges. For example, conversations in a telecommunication network or messages in a social network can be represented as a massive stream of edges. Such streams are typically very large, because of...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    Dynamic Join Optimization in Multi-Hop Wireless Sensor Networks

    To enable smart environments and self-tuning data centers, the authors are developing the Aspen system for integrating physical sensor data, as well as stream data coming from machine logical state, and database or Web data from the Internet. A key component of this system is a query processor optimized for...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    Efficient B-Tree Based Indexing for Cloud Data Processing

    There has been an increasing interest in deploying a storage system on Cloud to support applications that require massive scalability and high throughput in storage layer. Examples of such systems include Amazon's Dynamo and Google's BigTable. Cloud storage systems are designed to meet several essential requirements of data-intensive applications: manageability,...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    Nearest Neighbor Search With Strong Location Privacy

    The tremendous growth of the Internet has significantly reduced the cost of obtaining and sharing information about individuals, raising many concerns about user privacy. Spatial queries pose an additional threat to privacy because the location of a query may be sufficient to reveal sensitive information about the querier. In this...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    Secure Personal Data Servers: A Vision Paper

    An increasing amount of personal data is automatically gathered and stored on servers by administrations, hospitals, insurance companies, etc. Citizen themselves often count on internet companies to store their data and make them reliable and highly available through the internet. However, these benefits must be weighed against privacy risks incurred...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    PolicyReplay: Misconfiguration-Response Queries for Data Breach Reporting

    Recent legislation has increased the requirements of organizations to report data breaches, or unauthorized access to data. While access control policies are used to restrict access to a database, these policies are complex and difficult to configure. As a result, misconfigurations sometimes allow users access to unauthorized data. In this...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    Automatic Rule Refinement for Information Extraction

    Rule-based information extraction from text is increasingly being used to populate databases and to support structured queries on unstructured text. Specification of suitable information extraction rules requires considerable skill and standard practice is to refine rules iteratively, with substantial effort. In this paper, the authors show that techniques developed in...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    PAO: Power-Efficient Attribution of Outliers in Wireless Sensor Networks

    Sensor nodes constitute inexpensive, disposable devices that are often scattered in harsh environments of interest so as to collect and communicate desired measurements of monitored quantities. Due to the commodity hardware used in the construction of sensor nodes, the readings of sensors are frequently tainted with outliers. Given the presence...

    Provided By VLDB Endowment

  • White Papers // Aug 2010

    SECRET: A Model for Analysis of the Execution Semantics of Stream Processing Systems

    There are many academic and commercial Stream Processing Engines (SPEs) today, each of them with its own execution semantics. This variation may lead to seemingly inexplicable differences in query results. In this paper, the authors present SECRET, a model of the behavior of SPEs. SECRET is a descriptive model that...

    Provided By VLDB Endowment

  • White Papers // Aug 2010

    Using XMorph to Transform XML Data

    XMorph is a new, shape polymorphic, domain-specific XML query language. A query in a shape polymorphic language adapts to the shape of the input, freeing the user from having to know the input's shape and making the query applicable to a wide variety of differently shaped inputs. An XMorph query...

    Provided By VLDB Endowment

  • White Papers // Aug 2010

    Active Complex Event Processing: Applications in Real-Time Health Care

    The analysis of many real-world event based applications has revealed that existing Complex Event Processing technology (CEP), while effective for efficient pattern matching on event stream, is limited in its capability of reacting in real-time to opportunities and risks detected or environmental changes. The authors are the first to tackle...

    Provided By VLDB Endowment

  • White Papers // Aug 2010

    Thirteen New Players in the Team: A Ferrybased LINQ to SQL Provider

    The authors demonstrate an efficient LINQ to SQL provider and its significant impact on the runtime performance of LINQ programs that process large data volumes. This alternative provider is based on Ferry, compilation technology that lets relational database systems participate in the evaluation of first-order functional programs over nested, ordered...

    Provided By VLDB Endowment

  • White Papers // Aug 2010

    AXART Enabling Collaborative Work With AXML Artifacts

    The workflow models have been essentially operation-centric for many years, ignoring almost completely the data aspects. Recently, a new paradigm of data-centric workflows, called business artifacts, has been introduced by Nigam and Caswell. The authors follow this approach and propose a model where artifacts are XML documents that evolve in...

    Provided By VLDB Endowment

  • White Papers // Aug 2010

    iFlow: An Approach for Fast and Reliable InternetScale Stream Processing Utilizing Detouring and Replication

    The authors propose to demonstrate iFlow, the replication-based system that supports both fast and reliable processing of data streams over the Internet. iFlow uses a low degree of replication in conjunction with detouring techniques to overcome network outages. iFlow also deploys replicas in a manner that improves performance and availability...

    Provided By VLDB Endowment

  • White Papers // Aug 2010

    Peer Coordination Through Distributed Triggers

    This is a demonstration of data coordination in a peer data management system through the employment of distributed triggers. The latter express in a declarative manner individual security and consistency requirements of peers, that cannot be ensured by default in the P2P environment. Peers achieve to handle in a transparent...

    Provided By VLDB Endowment

  • White Papers // Aug 2010

    Seaform: Search As You Type in Forms

    Form-style interfaces have been widely used to allow users to access information. In this demonstration paper, the authors develop a new search paradigm in form-style query interfaces, called SEAFORM (which stands for SEarch-As-You-Type in FORMS), which computes answers on-the-fly as a user types in a query letter by letter and...

    Provided By VLDB Endowment

  • White Papers // Aug 2010

    TimeTrails: A System for Exploring Spatio Temporal Information in Documents

    Spatial and temporal data have become ubiquitous in many application domains such as the Geosciences or life sciences. Sophisticated database management systems are employed to manage such structured data. However, an important source of spatio-temporal information that has not been fully utilized are unstructured text documents. In this paper, combinations...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Community-Driven Data Grids

    Beyond already existing huge data volumes, e-science communities face major challenges in managing the anticipated data deluge of forthcoming projects. Community-driven data grids target at domain-specific federations and provide a distributed, collaborative data management by employing dominant data characteristics (e. g., data skew) and query patterns to optimize the overall...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    Read-Once Functions and Query Evaluation in Probabilistic Databases

    Probabilistic databases hold promise of being a viable means for large-scale uncertainty management, increasingly needed in a number of real world applications domains. However, query evaluation in probabilistic databases remains a computational challenge. Prior work on efficient exact query evaluation in probabilistic databases has largely concentrated on query-centric formulations (e.g.,...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    On Dense Pattern Mining in Graph Streams

    Many massive web and communication network applications create data which can be represented as a massive sequential stream of edges. For example, conversations in a telecommunication network or messages in a social network can be represented as a massive stream of edges. Such streams are typically very large, because of...

    Provided By VLDB Endowment

  • White Papers // Mar 2011

    CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads

    Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, the authors solve index tuning for large problem instances that are common in practice, e.g., thousands of queries in the workload, thousands of candidate indexes and several hard and...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    Dynamic Join Optimization in Multi-Hop Wireless Sensor Networks

    To enable smart environments and self-tuning data centers, the authors are developing the Aspen system for integrating physical sensor data, as well as stream data coming from machine logical state, and database or Web data from the Internet. A key component of this system is a query processor optimized for...

    Provided By VLDB Endowment

  • White Papers // Aug 2009

    Supporting Realworld Activities in Database Management Systems

    Databases are integral to many application domains in which the cycle of processing the data is complex and may involve real-world activities that are external to the database, e.g., wet-lab experiments, manual measurements, and collecting instrument readings. As a result, an update operation in the database may render dependent data...

    Provided By VLDB Endowment

  • White Papers // Apr 2011

    Albatross: Lightweight Elasticity in Shared Storage Databases for the Cloud Using Live Data Migration

    Database systems serving cloud platforms must serve large numbers of applications (or tenants). In addition to managing tenants with small data footprints, different schemas, and variable load patterns, such multitenant data platforms must minimize their operating costs by efficient resource sharing. When deployed over a pay-per-use infrastructure, elastic scaling and...

    Provided By VLDB Endowment

  • White Papers // Jan 2011

    Graph Indexing of Road Networks for Shortest Path Queries With Label Restrictions

    The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. The authors introduce a new shortest path query type in which dynamic constraints may be placed on the allowable set of edges that can appear on a valid shortest...

    Provided By VLDB Endowment

  • White Papers // Nov 2008

    Data Markets in the Cloud: An Opportunity for the Database Community

    Cloud-computing is transforming many aspects of data management. Most recently, the cloud is seeing the emergence of digital markets for data and associated services. The authors observe that their community has a lot to offer in building successful cloud-based data markets. They outline some of the key challenges that such...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    A Framework for Supporting DBMS-Like Indexes in the Cloud

    To support "Database as a service" (DaaS) in the cloud, the database system is expected to provide similar functionalities as in centralized DBMS such as efficient processing of ad hoc queries. The system must therefore support DBMS-like indexes, possibly a few indexes for each table to provide fast location of...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    Efficient B-Tree Based Indexing for Cloud Data Processing

    There has been an increasing interest in deploying a storage system on Cloud to support applications that require massive scalability and high throughput in storage layer. Examples of such systems include Amazon's Dynamo and Google's BigTable. Cloud storage systems are designed to meet several essential requirements of data-intensive applications: manageability,...

    Provided By VLDB Endowment

  • White Papers // Sep 2010

    PAO: Power-Efficient Attribution of Outliers in Wireless Sensor Networks

    Sensor nodes constitute inexpensive, disposable devices that are often scattered in harsh environments of interest so as to collect and communicate desired measurements of monitored quantities. Due to the commodity hardware used in the construction of sensor nodes, the readings of sensors are frequently tainted with outliers. Given the presence...

    Provided By VLDB Endowment

  • White Papers // Nov 2011

    PIQL: Success-Tolerant Query Processing in the Cloud

    Newly-released web applications often succumb to a "Success Disaster," where overloaded database machines and resulting high response times destroy a previously good user experience. Unfortunately, the data independence provided by a traditional relational database system, while useful for agile development, only exacerbates the problem by hiding potentially expensive queries under...

    Provided By VLDB Endowment

  • White Papers // Jul 2011

    Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data

    Given a query object q, a Reverse Nearest Neighbor (RNN) query in a common certain database returns the objects having q as their nearest neighbor. A new challenge for databases is dealing with uncertain objects. In this paper, the authors consider Probabilistic Reverse Nearest Neighbor (PRNN) queries, which return the...

    Provided By VLDB Endowment

  • White Papers // Jun 2011

    Monitoring Reverse Top-k Queries Over Mobile Devices

    Location-based queries are widely employed to retrieve useful information based on the user's geographical position. For example, a tourist that walks around a city may seek points of interest (e.g., restaurants) in her vicinity that satisfy her preferences (e.g., cheap and highly-rated). A top-k query defined by the user preferences...

    Provided By VLDB Endowment

  • White Papers // Nov 2010

    Efficient Processing of Top-k Spatial Preference Queries

    Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of location-based applications that rely on spatial preference queries, existing algorithms incur non-negligible processing cost resulting in high response time. The...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    RemusDB: Transparent High Availability for Database Systems

    In this paper, the authors present a technique for building a High-Availability (HA) DataBase Management System (DBMS). The proposed technique can be applied to any DBMS with little or no customization, and with reasonable performance overhead. Their approach is based on Remus, a commodity HA solution implemented in the virtualization...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    DivDB: A System for Diversifying Query Results

    With the availability of very large databases, an exploratory query can easily lead to a vast answer set, typically based on an answer's relevance (i.e., top-k, tf-idf) to the user query. Navigating through such an answer set requires huge effort and users give up after perusing through the first few...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    Online Data Fusion

    The Web contains a significant volume of structured data in various domains, but a lot of data are dirty and erroneous, and they can be propagated through copying. While data integration techniques allow querying structured data on the Web, they take the union of the answers retrieved from different sources...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    Summary Graphs for Relational Database Schemas

    Increasingly complex databases need ever more sophisticated tools to help users understand their schemas and interact with the data. Existing tools fall short of either providing the "Big picture," or of presenting useful connectivity information. In this paper, the authors define summary graphs, a novel approach for summarizing schemas. Given...

    Provided By VLDB Endowment

  • White Papers // Aug 2010

    SECRET: A Model for Analysis of the Execution Semantics of Stream Processing Systems

    There are many academic and commercial Stream Processing Engines (SPEs) today, each of them with its own execution semantics. This variation may lead to seemingly inexplicable differences in query results. In this paper, the authors present SECRET, a model of the behavior of SPEs. SECRET is a descriptive model that...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    MapReduce Programming and Cost based Optimization? Crossing This Chasm With Starfish

    MapReduce has emerged as a viable competitor to database systems in big data analytics. MapReduce programs are being written for a wide variety of application domains including business data processing, text analysis, natural language processing, Web graph and social network analysis, and computational science. However, MapReduce systems lack a feature...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    Proactive Detection and Repair of Data Corruption: Towards a Hasslefree Declarative Approach With Amulet

    Occasional corruption of stored data is an unfortunate byproduct of the complexity of modern systems. Hardware errors, software bugs, and mistakes by human administrators can corrupt important sources of data. The dominant practice to deal with data corruption today involves administrators writing ad hoc scripts that run data-integrity tests at...

    Provided By VLDB Endowment

  • White Papers // Sep 2011

    Scalable SPARQL Querying of Large RDF Graphs

    The generation of RDF data has accelerated to the point where many data sets need to be partitioned across multiple machines in order to achieve reasonable performance when querying the data. Although tremendous progress has been made in the Semantic Web community for achieving high performance data management on a...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Studying Interaction Methodologies in Video Retrieval

    So far, several approaches have been studied to bridge the problem of the Semantic Gap, the bottleneck in image and video retrieval. However, no approach is successful enough to increase retrieval performances significantly. One reason is the lack of understanding the user's interest, a major condition towards adapting results to...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Mining Patterns and Rules for Software Specification Discovery

    Software specifications are often lacking, incomplete and outdated in the industry. Lack and incomplete specifications cause various software engineering problems. Studies have shown that program comprehension takes up to 45% of software development costs. One of the root causes of the high cost is the lack-of documented specification. Also, outdated...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Towards Efficient Main-Memory Use For Optimum Tree Index Update

    An emerging class of database applications is characterized by frequent updates of low-dimensional data, e.g. coming from sensors that sample continuous real world phenomena. Traditional persistency requirements can be weakened in this setting of frequent updates, emphasizing a role of the main-memory in external storage index structures and enabling a...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Implementing Filesystems by Tree-Aware DBMSs

    With the rise of XML, the database community has been challenged by semi-structured data processing. Since the data type behind XML is the tree, state-of-the-art RDBMSs have learned to deal with such data. This paper introduces a Ph.D. project focused on the question in how far the tree-awareness of recent...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Adaptive Workflow Scheduling Under Resource Allocation Constraints and Network Dynamics

    Workflow concepts are well suited for scenarios where many distributed entities work collaboratively together to achieve a common goal. Today, workflows are mostly used as computerized model for business processes executed in instances in commercial Workflow Management Systems. However, there are many other application domains where computer-supported cooperative work can...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Privacy Preserving Document Indexing Infrastructure for a Distributed Environment

    To carry out work assignments, small groups distributed within a larger enterprise or collaborative community often need to share documents among themselves while shielding those documents from others' eyes. In this paper, users need an indexing facility that can quickly locate relevant documents that they are allowed to access, without...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    GS-TMS: A Global Stream-Based Threat Monitor System

    Computer networks have become ubiquitous and integral part of the nation's critical infrastructure. How to grasp the real-time overall situation of the network security is very noteworthy to study. Current network security systems make great contributions in enhancing the network security. Nevertheless, these products are independent and autonomous, so they...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Incompleteness in Information Integration

    Information integration is becoming a critical problem for both businesses and individuals. The data, especially the one that comes from the Web, is naturally incomplete, that is, some data values may be unknown or lost because of communication problems, hidden due to privacy considerations. At the same time research in...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Querying Web-Based Applications Under Models of Uncertainty

    Many businesses offer their services to customers via Web-based application interfaces. Reasoning about execution flows of such applications is extremely valuable for companies. Such reasoning must often operate under terms of uncertainty and partial information, due to partial tracing, effects of unknown external parameters, and more. The objectives of this...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    XML-Document-Filtering Automaton

    In a publish-subscribe system based on filtering of XML documents subscribers specify their interests with profiles expressed in the XPath language. The system processes a stream of XML documents and delivers to subscribers a notification or content of documents that match the profiles. The authors present a new XML-document-filtering algorithm...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    XML Structural Summaries

    This paper introduces the concept of XML Structural Summaries and describes their role within XML retrieval. It covers the usage of those summaries for Database-style query processing and Information Retrieval-style search tasks in the context of both centralized and distributed environments. Finally, it discusses new retrieval scenarios that can potentially...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Scheduling Continuous Queries in Data Stream Management Systems

    Recently, several policies have been proposed for scheduling multiple Continuous Queries (CQs) in a Data Stream Management System (DSMS). The decision on which policy to use plays an important role in shaping the perceived online performance provided by the DSMS. In this paper, the authors provide an overview of different...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Detecting Clusters in Moderate-to-High Dimensional Data: Subspace Clustering, Patternbased Clustering, and Correlation Clustering

    Clustering aims at dividing data sets into subsets (clusters), maximizing intra-cluster-similarity while minimizing inter-cluster-similarity of objects. While clustering in general is a rather dignified problem, mainly in about the last decade new approaches have been proposed to cope with new challenges of high dimensional data. This new family of algorithms...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Finding Frequent Items in Data Streams

    The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in data stream mining, dating back to the 1980s. Many applications rely directly or indirectly on finding...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    Querying and Mining of Time Series Data: Experimental Comparison of Representations and Distance Measures

    The last decade has witnessed tremendous growths of interests in applications that deal with querying and mining of time series data. Numerous representation methods for dimensionality reduction and similarity measures geared towards time series have been introduced. Each individual work introducing a particular method has made specific claims and, aside...

    Provided By VLDB Endowment

  • White Papers // Aug 2008

    ColumnStore Support for RDF Data Management: Not All Swans Are White

    This paper reports on the results of an independent evaluation of the techniques presented in the VLDB 2007 paper "Scalable Semantic Web Data Management Using Vertical Partitioning", authored by D. Abadi, A. Marcus, S. R. Mad-den, and K. Hollenbach. The authors revisit the proposed bench-mark and examine both the data...

    Provided By VLDB Endowment