2010 2nd International Workshop on Database Technology and Applications

27-28 Nov. 2010

Filter Results

Displaying Results 1 - 25 of 195
  • [Title page]

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

    Publication Year: 2010, Page(s): i
    Request permission for reuse | PDF file iconPDF (98 KB)
    Freely Available from IEEE
  • Message from the Workshop Chair

    Publication Year: 2010, Page(s): i
    Request permission for reuse | PDF file iconPDF (90 KB)
    Freely Available from IEEE
  • DBTA 2010 Organizing Committee

    Publication Year: 2010, Page(s): i
    Request permission for reuse | PDF file iconPDF (94 KB)
    Freely Available from IEEE
  • Program Committee Members

    Publication Year: 2010, Page(s): i
    Request permission for reuse | PDF file iconPDF (85 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2010, Page(s): i
    Request permission for reuse | PDF file iconPDF (86 KB)
    Freely Available from IEEE
  • List of papers

    Publication Year: 2010, Page(s):i - x
    Request permission for reuse | PDF file iconPDF (65 KB)
    Freely Available from IEEE
  • An Improved Automatic FCM Clustering Algorithm

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

    For the limited application and shortcoming of FCM (Fuzzy C-Means) clustering algorithm, an improved automatic FCM clustering algorithm is put forward. First, the fuzzy equivalent matrix is achieved by fuzzier the standard uniform data sets; then, the objective function of the improved automatic FCM clustering algorithm is optimized by the amendment of membership function and distance measuring fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A High Efficient Task Scheduling Algorithm Based on Heterogeneous Multi-Core Processor

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

    Task scheduling is an important part of high performance multi-core building. The shortcomings of existing task scheduling algorithms is analyzed, and a new efficient heuristic task scheduling algorithm, namely,HCDDSL is proposed in this paper. Firstly, the new algorithm optimizes DAG graph by using clustering, then the nodes are descended by the values of Succ_sum,the task schedule has been proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Particle Swarm Optimization Based GM(1,2) Method on Day-Ahead Electricity Price Forecasting with Predicted Error Improvement

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

    Under deregulated environment, accurate electricity price forecasting is a crucial issue concerned by all participants. Experience shows that single forecasting model is very difficult to improve the forecasting accuracy due to the complicated factors affecting electricity prices. A particle swarm optimization (PSO) based GM(1,2) method on day-ahead electricity price forecasting with predicted err... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constant Linear Speed Control of Motor Based on Fuzzy PI in Strip Winding System

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

    The prestressed dies is an important way to improve the using life of the dies. This paper mainly analyzes the linear speed control of the winding system based on fuzzy PI where the winding tension of the system is considered as a load disturbance. Based on the actual system, the mathematical model of the winding system is built in Matlab/Simulink. The fuzzy PI control method is applied to improve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Method for Processing Reverse Skyline Queries over Arbitrary Spatial Objects

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

    Although several algorithms for computing the reverse skyline queries have been proposed, they are developed only for point datasets and cannot handle reverse skyline queries over arbitrary spatial objects such as regions, polygons or lines. In this paper, we introduce a novel method for processing reverse skyline queries over arbitrary spatial objects. The proposed method also processes reverse s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Two-Phased Refinement Algorithm to Process Reverse Skylines without Pre-Processing

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

    Reverse skyline queries are difficult to process because of the massive amount of computations for checking candidates because existing algorithms for reverse skylines are generally based on pre-processing. Although pre-processing reduces the number of computations on processing queries, it requires re-computations of pre-processed result every time data change. To overcome this limitation, we pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph Drawing by Force-Directed Method in Mirror Frames

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

    The most widely used algorithms for graph drawing are force-directed algorithms. We should modify a hybrid force model that is coupling a traditional spring force model and a novel repulsive force model will be proposed to solve the graph drawing problems in 2-D space. Especially, regular triangle drawing frame can be applied to binary tree drawing problems that on an important contribution to com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GATuner: Tuning Schema Matching Systems Using Genetic Algorithms

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

    Most recent schema matching systems combine multiple components, each of which employs a particular matching technique with several knobs. The multi-component nature has brought tuning problems for domain users. In this paper, we present GATuner, an approach to automatically tune schema matching systems using genetic algorithms. We match a given schema S against generated scenarios, for which the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregating Multiple Ontology Similarity Based on IOWA Operator

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

    Different ontology matching approaches which utilize diverse semantic information to bridge heterogenous ontologies perform different adaptability and use value on the same task. Usually, combination of a set of different matching approaches can achieve higher accuracy than single approach. Therefore, a method based on induced ordered weighted averaging operator (IOWA) is proposed in this paper to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A More Accurate Space Saving Algorithm for Finding the Frequent Items

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

    The frequent items problem is to process a stream as 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. Aiming at higher false positive rate of the Space-Saving algorithm, an LRU-based (Least Recently Used, LRU) improved algorithm with low frequency item pre-eliminate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multisensor Estimation Fusion for Wireless Networks with Mixed Data Delays

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

    Motivated by the extensive application of sensor networks in the multisensor target tracking systems, the problem of data fusion with mixed time delays which includes short timedelay and long time-delay is considered in this paper. In order to overcome several primary problems occurred in the existing fusion methods based on the "Out-Of-Sequence" Measurements (OOSMs), such as high investment for t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Storing and Indexing RDF Data in a Column-Oriented DBMS

    Publication Year: 2010, Page(s):1 - 4
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (130 KB) | HTML iconHTML

    Effcient RDF data management is an essential factor in realizing the Semantic Web vision. However, most existing RDF storage schemes based on row-store relational databases are constrained in terms of efficiency and scalability. In this paper, we propose an RDF storage scheme that implements sextuple indexing for RDF triples using a column-oriented DBMS. To evaluate the performance of our approach... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Personalized Recommendation Model Based on Social Tags

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

    In traditional e-commerce websites, social tags are used in product classification only, and not applied in the domain of personalized recommendation technology. In this paper, we propose a personalized recommendation model based on social tags. We build a user interest model for products by reflecting user interest and product features directly through social tags, and optimize the interest model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Filtering Fusion for Asynchronous System with Integer Times Sampling

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

    This paper studies the design of data fusion algorithm for asynchronous system with integer times sampling. Firstly, the multisensor asynchronous samplings is mapped to the basic axis, accordingly a sampling sequence of single sensor can be taken. Secondly, aiming at the sensor with the densest sampling points, the modified parallel filtering is given. Afterwards, the sequential filtering fusion m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trust Based Access Control Framework for R-OSGi

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

    In open pervasive computing environment, various devices and applications are frequently changeable. It is hard to authenticate strange entities for lack of centralized management authority. In order to solve access control problem in open pervasive environment, a trust based access control framework is introduced in this paper, and a corresponding prototype system is designed, implemented and int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Multimedia Database Application for Vehicle Surveillance System

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

    Vehicles surveillance system provide a large range of informational services for the driver and administrator such as multi view road and driver surveillance videos from multiple cameras mounted on the vehicle, video shots highlighting the traffic conditions on the roads and monitoring driving behavior. Annotation and retrieving of these video streams has an importance role on visual aids for safe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speed up Linear Scan in High-Dimensions Using Extended B+-Tree

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

    High-dimensional indexing is a pervasive challenge faced in multimedia retrieval. Existing indexing methods applying linear scan strategy, such as VA-file and its variations, are still efficient when the dimensionality is high. In this paper, we propose a new access idea implemented on linear scan based methods to speed up the nearest-neighbor queries. The idea is to map high-dimensional points in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Effective Algorithm Based on Association Graph and Matrix for Mining Association Rules

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

    Association rule mining is a very important research topic in the field of data mining. Discovering frequent itemsets is the key process in association rule mining. Traditional association rule algorithms adopt an iterative method, which requires very large calculations and a complicated transaction process. FAR (Feature Matrix Based Association Rules) algorithm solves this problem. However, FAR a... View full abstract»

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