By Topic

2010 Second International Conference on Advances in Databases, Knowledge, and Data Applications

11-16 April 2010

Filter Results

Displaying Results 1 - 25 of 47
  • [Front cover]

    Publication Year: 2010, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (841 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2010, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (11 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2010, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2010, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (109 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2010, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (173 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2010, Page(s):ix - x
    Request permission for commercial reuse | PDF file iconPDF (70 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2010, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (71 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2010, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (71 KB)
    Freely Available from IEEE
  • Analysis of the Quality of Life after an Endoscopic Thoracic Sympathectomy: A Business Intelligence Approach

    Publication Year: 2010, Page(s):1 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB) | HTML iconHTML

    Primary hyperhidrosis, a disorder characterized by an excessive sweating, has been treated by endoscopic thoracic sympathectomy. As a consequence of the surgery, patients improved their overall quality of life. Their day-by-day activities are not affected, or are less affected, by this disorder, and their emotional state verifies a significant improvement, from a situation of shame and self-punish... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling Topological Relations between Uncertain Spatial Regions in Geo-spatial Databases: Uncertain Intersection and Difference Topological Model

    Publication Year: 2010, Page(s):7 - 15
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1314 KB) | HTML iconHTML

    Topological relations have played important roles in spatial query, analysis and reasoning in Geographic Information Systems (GIS) and geospatial databases. The topological relations between crisp, uncertain and fuzzy spatial regions based upon the 9-intersections model have been identified. The research issue of topological relations, particularly, between spatial regions with uncertainties, has ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interoperable and Easy-to-Use Web Services for the Bioinformatics Community - A Case Study

    Publication Year: 2010, Page(s):16 - 21
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    In the field of bioinformatics, there exists a large number of web service providers and many competing standards regarding how data should be represented and interfaced. However, these web services are often hard to use for a non-expert programmer and it can be especially hard to see how different services can be used together to create scientific workflows. In this paper we have performed a lite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring the Use of Mixed Abstractions in SQL:1999 - A Framework-Based Approach

    Publication Year: 2010, Page(s):22 - 27
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (383 KB) | HTML iconHTML

    SQL: 1999 introduced the capability to support object concepts. It is now possible to design an SQL database schema using relational and object models. Each model represents a different abstraction. We use a framework to understand the implications of this change and to explore the use of mixed abstractions in an SQL: 1999 schema. We describe two new kinds of schema. We find that current object-re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Social Network Extraction Using a Graph Database

    Publication Year: 2010, Page(s):28 - 34
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    In the enterprise context, an important amount of information is stored in relational databases. Therefore, relational database can be a rich source to extract social network. Moreover, it is not very suitable to present and store a social network. On the other hand, a graph database canmodel data in natural way and facilitates the query of data using graph operations. In this way, we propose a so... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimistic Synchronization of Cooperative XML Authoring Using Tunable Transaction Boundaries

    Publication Year: 2010, Page(s):35 - 40
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    Design applications, e.g., CAD or media production, often require multiple users to work cooperatively on shared data, e.g., XML documents. Using explicit transactions in such environments is difficult, because designers usually do not want to consider transactions or ACID. However, applying transactions in order to control visibility of changes or specify recovery units, is reasonable, but determ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sudoku Bit Arrangement for Combined Demosaicking and Watermarking in Digital Camera

    Publication Year: 2010, Page(s):41 - 44
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1349 KB) | HTML iconHTML

    In this paper, an enhanced combined demosaicking and watermarking (CDW) method is proposed. Such a combination leads to lower power and time consumption comparing with being performed separately. In the proposed method, bits are arranged in a special order employing a Sudoku pattern. Results indicate that this arrangement increases robustness against JPEG compression attack. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing Optimistic Concurrency Control for Persistence Middleware Using Row Version Verification

    Publication Year: 2010, Page(s):45 - 50
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (319 KB) | HTML iconHTML

    Modern web-based applications are often built as multi-tier architecture using persistence middleware. Middleware technology providers recommend the use of Optimistic Concurrency Control (OCC) mechanism to avoid the risk of blocked resources. However, most vendors of relational database management systems implement only locking schemes for concurrency control. As consequence a kind of OCC has to b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of Different Solutions for Solving the Optimization Problem of Large Join Queries

    Publication Year: 2010, Page(s):51 - 55
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (289 KB) | HTML iconHTML

    The article explores the optimization of queries using genetic algorithms and compares it with the conventional query optimization component. Genetic algorithms (GAs), as a data mining technique, have been shown to be a promising technique in solving the ordering of join operations in large join queries. In practice, a genetic algorithm has been implemented in the PostgreSQL database system. Using... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Understanding Linked Open Data as a Web-Scale Database

    Publication Year: 2010, Page(s):56 - 61
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (787 KB) | HTML iconHTML

    While Linked Open Data (LOD) has gained much attention in the recent years, requirements and the challenges concerning its usage from a database perspective are lacking. We argue that such a perspective is crucial for increasing acceptance of LOD. In this paper, we compare the characteristics and constraints of relational databases with LOD, trying to understand the latter as a Web-scale database.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring Social Patterns in Mobile Data

    Publication Year: 2010, Page(s):62 - 68
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (547 KB) | HTML iconHTML

    To compete with other telecom providers, it is important to understand the behavior of the customers and predict their needs. In order to realize this, it is required to explore the customers details based on their mobile usage behavior into social patterns (segments) and target the suitable segments for advertising. In our approach, the usage data of the customers in association with their browsi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intelligent Network Communications for Distributed Database Systems

    Publication Year: 2010, Page(s):69 - 74
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (306 KB) | HTML iconHTML

    Customizing network sites have become an increasingly important issue in distributed database systems. This will improve the network system performance by reducing the number of communications required for query processing in terms of retrieval and update transactions. This paper presents an intelligent clustering method for distributed database system that provides a structure for organizing larg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Evaluation of an Optimistic Concurrency Control Algorithm for Temporal Databases

    Publication Year: 2010, Page(s):75 - 81
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (319 KB) | HTML iconHTML

    We propose in this paper a performance study of an access concurrency control algorithm for temporal databases. This algorithm is based on the optimistic approach, which is, in our opinion, more suitable for temporal databases than the pessimistic methods. Indeed, our optimistic algorithm, in the contrary to the pessimistic ones, can exploit the temporal specifications to reduce the granule size a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Algorithm for the Containment Problem of Conjunctive Queries with Safe Negation

    Publication Year: 2010, Page(s):82 - 90
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    Many queries about real databases have a particular form, e.g., the negated part consists of one single literal or they contain just a single binary relation, etc. For a particular class of queries, it is useful to construct algorithms for the containment problem, that are better than those for the whole class of queries. The paper is about the problem of query containment for conjunctive queries ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Can Queries Help to Validate Database Design?

    Publication Year: 2010, Page(s):91 - 96
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    The design of a conceptual database schema is a critical task. The more methods a conceptual database designer has in order to communicate with the end user, the better it is for the quality of the conceptual schema. This paper focuses on the question: Can queries be used for checking missing concepts in a conceptual database schema? The usefulness of queries for schema checking will be presented ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trend-Based Similarity Search in Time-Series Data

    Publication Year: 2010, Page(s):97 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (517 KB) | HTML iconHTML

    In this paper, we present a novel approach towards time-series similarity search. Our technique relies on trends in a curve's movement over time. A trend is characterized by a series', values channeling in a certain direction (up, down, sideways) over a given time period before changing direction. We extract trend-turning points and utilize them for computing the similarity of two series based on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Maintenance of k-Dominant Skyline for Frequently Updated Database

    Publication Year: 2010, Page(s):107 - 110
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (430 KB) | HTML iconHTML

    Skyline queries retrieve a set of skyline objects so that the user can choose promising objects from them and make further inquiries. However, a skyline query often retrieves too many objects to analyze intensively. To solve the problem, k-dominant skyline queries have been introduced, which can reduce the number of retrieved objects by relaxing the definition of the dominance. Though it can reduc... View full abstract»

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