By Topic

Database Engineering and Applications Symposium, 2006. IDEAS '06. 10th International

Date 11-14 Dec. 2006

Filter Results

Displaying Results 1 - 25 of 55
  • 10th International Database Engineering and Applications Symposium - Cover

    Publication Year: 2006 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (158 KB)  
    Freely Available from IEEE
  • 10th International Database Engineering and Applications Symposium - Title

    Publication Year: 2006 , Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (437 KB)  
    Freely Available from IEEE
  • 10th International Database Engineering and Applications Symposium - Copyright

    Publication Year: 2006 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (53 KB)  
    Freely Available from IEEE
  • 10th International Database Engineering and Applications Symposium - Table of contents

    Publication Year: 2006 , Page(s): v - viii
    Save to Project icon | Request Permissions | PDF file iconPDF (126 KB)  
    Freely Available from IEEE
  • Foreword

    Publication Year: 2006 , Page(s): ix
    Save to Project icon | Request Permissions | PDF file iconPDF (37 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2006 , Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (48 KB)  
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2006 , Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (37 KB)  
    Freely Available from IEEE
  • A Tree for All Seasons

    Publication Year: 2006 , Page(s): 3 - 10
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (272 KB) |  | HTML iconHTML  

    The performance of in-memory databases is significantly affected by the number of data blocks fetched from memory into the processor-resident cache. In recent years, various tree-based indexes have been proposed for main memory databases. A common assumption in the analysis of these indexes is that there is no data in the cache that can be reused between key lookups, i.e. the system has a cold cac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Unit-Test Framework for Database Applications

    Publication Year: 2006 , Page(s): 11 - 20
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (324 KB) |  | HTML iconHTML  

    The outcome of a test of an application that stores data in a database naturally depends on the state of the database. It is therefore important that test developers are able to set up and tear down database states in a simple and efficient manner In existing unit-test frameworks, setting up and tearing down such test fixtures is labor intensive and often requires copy-and-paste of code. This pape... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CADRE: A Collaborative replica allocation and deallocation approach for Mobile-P2P networks

    Publication Year: 2006 , Page(s): 21 - 28
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (231 KB) |  | HTML iconHTML  

    This paper proposes CADRE (collaborative allocation and deallocation of replicas with efficiency), a dynamic replication scheme for improving the typically low data availability in mobile ad-hoc peer-to-peer (M-P2P) networks. The main contributions of CADRE are two-fold. First, it collaboratively performs both replica allocation and deallocation in tandem to facilitate optimal replication and to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collaborative Filtering Process in a Whole New Light

    Publication Year: 2006 , Page(s): 29 - 36
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (230 KB) |  | HTML iconHTML  

    Collaborative filtering (CF) systems are gaining widespread acceptance in recommender systems and e-commerce applications. These systems combine information retrieval and data mining techniques to provide recommendations for products, based on suggestions of users with similar preferences. Nearest-neighbor CF process is influenced by several factors, which were not examined carefully in past work.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Data Summaries for Approximate Query Processing in PDMS

    Publication Year: 2006 , Page(s): 37 - 44
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (306 KB) |  | HTML iconHTML  

    Evolving from heterogeneous database systems one of the main problems in peer data management systems (PDMS) is distributed query processing. With the absence of global knowledge such strategies have to focus on routing the query efficiently to only those peers that are most likely to contribute to the final result. Using routing indexes is one possibility to achieve this. Since data may change ov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective Incremental Clustering for Duplicate Detection in Large Databases

    Publication Year: 2006 , Page(s): 45 - 52
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (480 KB) |  | HTML iconHTML  

    We propose an incremental algorithm for discovering clusters of duplicate tuples in large databases. The core of the approach is the usage of an indexing technique which, for any newly arrived tuple mu, allows to efficiently retrieve a set of tuples in the database which are mostly similar to mu, and which are likely to refer to the same real-world entity which is associated with mu. The proposed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Incremental Subspace Clustering in Data Streams

    Publication Year: 2006 , Page(s): 53 - 60
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (337 KB) |  | HTML iconHTML  

    Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clustering streaming time series, based on the sliding window paradigm. More specifically, we use the concept of alpha-clusters in each time instance separately. A subspace alpha-cluster consists of a set of streams, whose val... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Mining of Constrained Frequent Patterns from Streams

    Publication Year: 2006 , Page(s): 61 - 68
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (179 KB) |  | HTML iconHTML  

    With advances in technology, a flood of data can be produced in many applications such as sensor networks and Web click streams. This calls for stream mining, which searches for implicit, previously unknown, and potentially useful information (such as frequent patterns) that might be embedded in continuous data streams. However, most of the existing algorithms do not allow users to express the pat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Processing of Narrow Range Queries in Multi-dimensional Data Structures

    Publication Year: 2006 , Page(s): 69 - 79
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (291 KB) |  | HTML iconHTML  

    Multi-dimensional data structures are applied in many real index applications, i.e. data mining, indexing multimedia data, indexing of text documents and so on. Many index structures and algorithms have been proposed. There are two major approaches to multi-dimensional indexing: data structures to indexing metric and vector spaces. R-trees, R*-trees and (B)UB-trees are representatives of the vecto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Indifference for Customization of Partial Order Skylines

    Publication Year: 2006 , Page(s): 80 - 88
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (457 KB) |  | HTML iconHTML  

    Unlike numerical preferences, preferences on attribute values do not show an inherent total order, but skyline computation has to rely on partial orderings explicitly stated by the user. In such orders many object values are incomparable, hence skylines sizes become unpractical. However, the Pareto semantics can be modified to benefit from indifferences: skyline result sizes can be essentially red... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized Indexing for Energy-Efficient Access to Partially Ordered Broadcast Data inWireless Networks

    Publication Year: 2006 , Page(s): 89 - 96
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (209 KB) |  | HTML iconHTML  

    Energy conservation and access efficiency are two fundamental though competing goals in broadcast wireless networks. To tackle the energy penalty from sequential searching, the interleaving of index with data items has been proposed. Although, quite important contributions exist on providing broadcast indexes, they have one or more of the following problems. Firstly, all of them assume total order... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LogicFence: A Framework for Enforcing Global Integrity Constraints at Runtime

    Publication Year: 2006 , Page(s): 97 - 104
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (337 KB) |  | HTML iconHTML  

    Large information systems (IS) comprise of several independent applications that share a common set of resources and data. Usually, there are implicit and subtle dependencies across these applications that are not specifically captured. This is especially so if the applications are bought off the shelf or are developed by independent third parties. Dependencies or global semantic constraints are d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-dimensional Histograms with Tight Bounds for the Error

    Publication Year: 2006 , Page(s): 105 - 112
    Cited by:  Patents (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (339 KB) |  | HTML iconHTML  

    Histograms are being used as non-parametric selectivity estimators for one-dimensional data. For high-dimensional data it is common to either compute one-dimensional histograms for each attribute or to compute a multi-dimensional equi-width histogram for a set of attributes. This either yields small low-quality or large high-quality histograms. In this paper we introduce HIRED (high-dimensional hi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PAID: Mining Sequential Patterns by Passed Item Deduction in Large Databases

    Publication Year: 2006 , Page(s): 113 - 120
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (321 KB) |  | HTML iconHTML  

    Sequential pattern mining is very important because it is the basis of many applications. Yet how to efficiently implement the mining is difficult due to the inherent characteristic of the problem - the large size of the dataset. Although there has been a great deal of effort on sequential pattern mining in recent years, its performance is still far from satisfactory. In this paper, we have propos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privacy preserving Data Mining Algorithms without the use of Secure Computation or Perturbation

    Publication Year: 2006 , Page(s): 121 - 128
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (203 KB) |  | HTML iconHTML  

    In our era knowledge is not "just" information any more, it is an asset. Data mining can be used to extract important knowledge from large databases. These days, it is often the case that such databases are distributed among several organizations who would like to cooperate in order to extract global knowledge, but at the same time, privacy concerns may prevent the parties from directly sharing th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Querying Encrypted XML Documents

    Publication Year: 2006 , Page(s): 129 - 136
    Cited by:  Papers (4)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (215 KB) |  | HTML iconHTML  

    This paper proposes techniques to query encrypted XML documents. Such a problem predominantly occurs in "database as a service" (DAS) architectures, where a client may outsource data to a service provider that provides data management services. Security is of paramount concern, as the service provider itself may be untrusted. Encryption offers a natural solution to preserve the confidentiality of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Securing the Borealis Data Stream Engine

    Publication Year: 2006 , Page(s): 137 - 147
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (284 KB) |  | HTML iconHTML  

    As data stream management systems (DSMSs) become more and more popular, there is an increasing need to protect such systems from adversaries. In this paper we present an approach to secure DSMSs. We propose a general security framework and an access control model to secure DSMSs. We implement our framework into an existing data stream management system and show that our approach not only works, by... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shrinked Data Marts Enabled for Negative Caching

    Publication Year: 2006 , Page(s): 148 - 157
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (335 KB) |  | HTML iconHTML  

    Data marts storing pre-aggregated data, prepared for further roll-ups, play an essential role in data warehouse environments and lead to significant performance gains in the query evaluation. However, in order to ensure the completeness of query results on the data mart without to access the underlying data warehouse, null values need to be stored explicitly; this process is denoted as negative ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.