The International Database Engineering & Applications Symposium (IDEAS) was established in 1997. IDEAS'10 is the fourteenth annual meeting in the IDEAS series and is being held in Montréal, Québec, Canada, during August 16-18, 2010. The conference aims to address the needs of the academic community in database and engineering, its application found in an ever increasing number of domains. It brings together academics, government and industry professionals to discuss recent progress and challenges in a broad range of areas in this domain such as data mining, databases, information retrieval, machine learning, as well as software engineering. IDEAS'10 also serves as a platform for theoreticians and practitioners to exchange their original research ideas on academic or application aspects of computing and engineering of database systems. They can present their new findings and share their experiences on integrating new technologies into products and applications. The symposium facilitates the discussion of their work as applied to real-life situations, and their development and operations of challenging database related systems, while identifying unsolved challenges.
In terms of submissions, we have attracted many high-quality papers submitted by authors globally including: Australia, Austria, Brazil, Canada, China, France, Germany, India, Iran, Ireland, Italy, Japan, Jordan, Macedonia, Norway, Portugal and United States.
For IDEAS'10, we continue to keep our tradition of inviting international experts in various aspects of database engineering to join our program committee. As a result, our Program Committee consists of professionals who have done an excellent job in finishing the single-blind review and on-line double-blind debate processes built into ConfSys. On average, about 97% of reviews were submitted by the due date and about 3.85 reviews were received for each paper.
Thus the paper selection process was thorough and competitive. On average, each paper was refereed by at least 3.85 reviewers, and about 17% of submissions were accepted as full research papers. This year, we have an intensive program that spans over three days. In addition to full research papers we also include selected short papers and posters, which allow authors to present new applications and explore untried research directions.
Synchronous metadata management of large storage systems
Today filesystems of big companies are both huge and distributed amongst the world. They contain huge sets of metadata, but are not optimized to analyze them. In contrast, if metadata is stored in a database system and updated synchronously, it could be ...
Clean first or dirty first?: a cost-aware self-adaptive buffer replacement policy
Flash SSDs originate a disruptive change concerning storage technology and become a competitor for conventional magnetic disks in the area of persistent database stores. Compared to them, they provide a dramatic speed-up for random reads, but exhibit a ...
Listen to the customer: model-driven database design
In modern IT landscapes, databases are subject to a major role change. Especially in Service-Oriented Architectures, databases are more and more frequently dedicated to a single application. Therefore, it is even more important to reflect the ...
LTIX: a compact level-based tree to index XML databases
Indexing XML data is essential for XML query optimization. Most of the existing approaches that combine a labeling scheme with a path index use labeling schemes that reflect the structure of the indexed data. In addition, the labeling rules do not ...
Indexing forecast models for matching and maintenance
Forecasts are important to decision-making and risk assessment in many domains. There has been recent interest in integrating forecast queries inside a DBMS. Answering a forecast query requires the creation of forecast models. Creating a forecast model ...
uCFS2: an enhanced system that mines uncertain data for constrained frequent sets
Frequent set mining searches for sets of items that are frequently co-occurring together. Existing algorithms mainly find all the frequent sets from precise data. However, there are real-life situations in which users are interested in only some tiny ...
NeuDetect: a neural network data mining wireless network intrusion detection system
This paper proposes NeuDetect, which applies a classification rule mining Neural Network technique to wireless network packets captured through hardware sensors for purposes of real time detection of anomalous packets. To address the problem of high ...
An efficient features-based processing technique for supergraph queries
Graphs are widely used for modeling complicated data such as social networks, chemical compounds, protein interactions, XML documents and multimedia databases. To be able to effectively understand and utilize any collection of graphs, a graph database ...
Semantic water data translation: a knowledge-driven approach
In order for the Bureau of Meteorology (BOM), Australia, to build and maintain an integrated national water information system, over 240 organisations are required to provide their data to BOM. These organisations use a wide range of systems and data ...
Exploitation of backup nodes for reducing recovery cost in high availability stream processing systems
Quick recovery from a failure is required essentially for distributed stream processing systems. We focus on single-node fail-stop failures occurred in high availability stream processing systems in this paper. One of high availability mechanisms is to ...
An integrative approach to query optimization in native XML database management systems
Even though an effective cost-based query optimizer is of utmost importance for the efficient evaluation of XQuery expressions in native XML database systems, such a component is currently out of sight, because former approaches do not pay attention to ...
Ambiguous content and disambiguation of XML schemata
In this paper we deal with the problem of ambiguous content in XML Schema systems. We explain the meaning of ambiguous content in XML documents, and how it relates to 1-unambiguous regular expressions. We then describe the Brüggemann-Klein and Wood ...
Modeling synchronized time series
We consider the class of applications that manage time series (TS) and propose a data model and a query language that let these applications manipulate TS data sets at a logical level. We introduce the concept of synchronized time series (STS) to model ...
Exploitation of event-semantics for distributed publish/subscribe systems in massively multiuser virtual environments
Triggered by the fast evolving technical capabilities for implementing distributed global scale applications, online games have grown to a huge industry in recent years. Particularly, Massive Multiuser Virtual Environments (MMVEs), which allow for ...
Representation and validation of domain and range restrictions in a relational database-driven ontology maintenance system
An ontology can be used to represent and organize the objects, properties, events, processes, and relations that embody an area of reality [1]. These knowledge bases may be created manually (by individuals or groups), and/or automatically using software ...
Fast sorting on flash memory sensor nodes
Sensor nodes are being used in numerous domains for data collection and analysis. The ability to perform on device data processing increases the functionality and lifetime of a network as it avoids network transmission. Previous work has developed ...
Multi-level bitmap indexes for flash memory storage
Due to their low access latency, high read speed, and power-efficient operation, flash memory storage devices are rapidly emerging as an attractive alternative to traditional magnetic storage devices. However, tests show that the most efficient indexing ...
Cherry picking in database languages
To avoid expensive round-trips between the application layer and the database layer it is crucial that data-intensive processing and calculations happen close to where the data resides -- ideally within the database engine. However, each application has ...
Optimizing XML twig queries in relational systems
In this paper, we propose a new approach for optimizing structural-join and twig queries for XML documents more effectively by utilizing the existing facilities of the relational database systems. Our approach is based on an enhanced structure of a ...
Automatic parameter determination in subspace clustering with gravitation function
Data mining is a process of discovering and exploiting hidden patterns from data. Clustering as an important task of data mining divides the observations into groups (clusters), which is according to the principle that the observations in the same ...
Multi-resolution approach to time series retrieval
We propose a new multi-resolution indexing and retrieval method of the similarity search problem in time series databases. The proposed method is based on a fast-and-dirty filtering scheme that iteratively reduces the search space using several ...
OXDBS: extension of a native XML database system with validation by consistency checking of OWL-DL ontologies
Native XML database systems provide mature technology for persisting XML data and documents. Ontologies are often represented as XML-based documents like OWL-DL ontologies which allow for semantic consistency checking by formal description logic. ...
A logic approach to virtual sensor networks
This paper presents a technique that builds a layer of virtual sensors over a sensor network. The virtual sensors are able to infer and provide data for the physical sensors that do not work. The key assumption of our approach is that the physical ...
On the expressiveness of generalization rules for XPath query relaxation
The problem of defining suitable rewriting mechanisms for XML query languages to support approximate query answering has received a great deal of attention in the last few years, owing to its practical impact in several scenarios. For instance, in the ...
A 24/7 monitorization tool for avoiding hypotensive episodes in critical care
The sudden fall of blood pressure (hypotension) is a common complication in medical care. In critical care patients, hypotension (HT) may cause serious heart, endocrine or neurological disorders, inducing severe or even lethal events. Moreover, recent ...
Using Monte Carlo simulation for improving data availability in P2P network
In this paper we present a replication strategy to improve data availability in P2P Networks. The focus of the paper is to replicate data to nodes which are highly available and complement one another in terms of uptimes. This would decrease the ...
Certain answers and rewritings for local regular path queries on graph-structured data
In this paper we explore the connection between certain answers and view-based rewritings for local regular path queries (RPQs) which are regular expressions matching paths in graph-structured data starting from a specific node. We show that differently ...
Efficient RDF data management including provenance and uncertainty
RDFKB (Resource Description Framework Knowledge Base) is a solution for managing, persisting and querying semantic web knowledge. RDFKB provides a flexible data management schema that allows additions, deletions, and updates at all levels in the data ...
An optimistic concurrency control algorithm for mobile ad-hoc network databases
With the rapid growth of database applications, wireless networking technology and mobile computing devices, there is a demand for processing mobile transactions in Mobile Ad-hoc Network (MANET) databases, so that mobile users can access and manipulate ...
How to juggle columns: an entropy-based approach for table compression
- Marcus Paradies,
- Christian Lemke,
- Hasso Plattner,
- Wolfgang Lehner,
- Kai-Uwe Sattler,
- Alexander Zeier,
- Jens Krueger
Many relational databases exhibit complex dependencies between data attributes, caused either by the nature of the underlying data or by explicitly denormalized schemas. In data warehouse scenarios, calculated key figures may be materialized or ...