By Topic

Databases for Next Generation Researchers, 2007. SWOD 2007. IEEE International Workshop on

Date 15-15 April 2007

Filter Results

Displaying Results 1 - 25 of 28
  • 2007 IEEE International Workshop on Databases for Next-Generation Researchers (SWOD)

    Save to Project icon | Request Permissions | PDF file iconPDF (79 KB)  
    Freely Available from IEEE
  • 2007 IEEE International Workshop on Databases for Next-Generation Researchers (SWOD)

    Page(s): i
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (56 KB)  

    The following topics are dealt with: data warehousing; OLAP; Internet; XML; high performance database system and data mining. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Copyright notice]

    Page(s): ii
    Save to Project icon | Request Permissions | PDF file iconPDF (137 KB)  
    Freely Available from IEEE
  • Table of contents

    Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (237 KB)  
    Freely Available from IEEE
  • Preface

    Page(s): v
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (62 KB)  

    First Page of the Article
    View full abstract»

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

    Page(s): vi - vii
    Save to Project icon | Request Permissions | PDF file iconPDF (57 KB)  
    Freely Available from IEEE
  • Spatial DataWarehouses: Some Solutions and Unresolved Problems

    Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (683 KB) |  | HTML iconHTML  

    Spatial Data Warehouses (SDWs) combine spatial databases and data warehouses allowing analysis of historical data represented in a space. This data can be queried using Spatial On-Line Analytical Processing (SOLAP) systems. SDW and SOLAP systems are emerging areas that raise several research issues. In this paper, we refer to different problems existing in SDWs that motivated us to propose the MultiDimER model - a conceptual multidimensional model able to express users' requirements for SDW and SOLAP applications. We present also different research directions that are important to consider to provide satisfactory solutions for SDW and for SOLAP systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OLAP Query Processing for XML Data in RDBMS

    Page(s): 7 - 12
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (463 KB) |  | HTML iconHTML  

    Extensible Markup Language (XML) has become an important format for data exchange and representation on the Web. In addition to conventional query processing, more complex analysis on XML data is considered to become important in order to discover valuable information. In this research, we attempt to investigate an XML-OLAP, by which we can perform multidimensional analysis on XML data taking XML's features into account. Users are allowed to specify XML data-cube by XPath, and perform analytical processing by XQuery with OLAP extension. The system is implemented on top of relational databases, and the given requests for data-cube specification and analysis are translated into SQL so that they can be processed using the underlying system. We show the feasibility of the proposed scheme by experimental evaluations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Algorithm for Complex Pattern Matching over Continuous Data Streams Based on Bit-Parallel Method

    Page(s): 13 - 18
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (409 KB) |  | HTML iconHTML  

    In this paper, we study a complex pattern matching problem over a single continuous stream of numerical values. Based on bit-parallel technique for string matching, we propose an efficient algorithm called BPS (Bit-Parallel matching on Streams) that finds the set of all occurrences of a given pattern of length m in an input stream of length n in O(1/u' mn) time for ordered values and in O(1/u' mn log m) time for real values over a fixed data range, where w is the bit-width of registers. This time complex properly improves the time complexity O(mn) of the previous algorithms. The keys of the algorithm are fast NFA simulation based on bit- parallel operation and hit predicate table lookup technique. We also present empirical analysis to evaluate the performance of the algorithm showing that the proposed algorithm is twice as fast as and more stable than the previous algorithms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sharing Flexibly Resizable Multidimensional Arrays in Client/Server Environment

    Page(s): 19 - 24
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (578 KB) |  | HTML iconHTML  

    Handling with large amount of data is common now. Employing extendible array to deal with increasing data is really effective. But in the conventional extendible arrays all of the operations such as extension and reduction can only occur to its surroundings. This property limits the application of extendible arrays. So we proposed our flexibly resizable multidimensional arrays which can insert or delete even in the midst of the array. In this paper we will propose a sharing scheme of resizable multidimensional arrays in a distributed environment which means the sharing of server side array by clients. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient reachability test on directed graphs and its application to large XML data

    Page(s): 25 - 30
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1299 KB) |  | HTML iconHTML  

    We propose an efficient algorithm for deciding the reachability between any nodes on XML data represented by connected directed graphs. In case of tree structures, the reachability is testable in a constant time by preprocessing the range labels of all nodes. However, in case of general directed graphs, it is impossible to set a simple range label for the graph even if it is acyclic. In this study, we introduce a new index for the problem of the reachability test on the general graphs. We show that our algorithm can check the reachability in almost constant time preserving the space efficiency and a reasonable preprocessing time compared with other methods. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Editable Browser for Reranking Web Search Results

    Page(s): 31 - 36
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (798 KB) |  | HTML iconHTML  

    This paper proposes methods of reranking Web search results according to user's editing operations while browsing the search results. It is difficult for search engines to rank search results which satisfy the user's search intention adequately because the user's Web search intentions are diverse. Hence, the user must check search results sequentially, or re-search creating a new query. In order to solve this problem, we introduce editing operations such as deletion and emphasis for searched results. When the user deletes a part of the search results, our system degrades search results which include the deleted term or sentence. When the user emphasizes a part of the search results, our system upgrades search results which include the emphasized term or sentence. We describe the implementations of these reranking methods and provide evaluations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Light-weight Acceleration for Streaming XML Document Filtering

    Page(s): 37 - 42
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (373 KB) |  | HTML iconHTML  

    We present a light-weight streaming XML document filtering tool named XAXEN, which is scalable with respect to the number of queries. XAXEN consists of (1) an XML file transformer on data-sending server, which transforms an XML file into a trie representing the tag-name sequences of the root-to-leaf paths in XML tree and the binary XML file where every start- and end-tag is replaced with a special symbol followed by the corresponding path trie node ID and with another symbol, and (2) a query processor on receivers. Computational experiments show that XAXEN is 2 ~ 6 times faster and 6 times space-efficient in comparison with XMLTK, a well-known scalable streaming XML document filter. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparative Quality Evaluation of TV Contents Based on Web Analysis

    Page(s): 43 - 48
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (645 KB) |  | HTML iconHTML  

    It is difficult to watch TV contents in an active manner such that the user can interactively select TV contents, because TV is originally a broadcast information media. It is also difficult for users to judge whether the information of TV contents is valid because conventional TV contents are not directly linked with related or evidence information. One of the methods to cope with these problems is to provide complementary or comparative information of TV contents obtained from other media such as Web etc. In our research, using the topic structure proposed by Ma et al., we evaluated quality of TV contents, and visualize the quality. In this paper, we defined "contents coverage," "generality," and "social acceptance" as aspects of TV contents' quality, and examined to what extent there is complementary information against TV contents in Web pages. We also implemented a new system to complement TV contents by Web pages, called "TV contents spectrum analyzer," which visualizes the degrees of generality and social acceptance of TV contents using WWW. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • XPCache: An Efficient Query Processor for Client-Server Architecture

    Page(s): 49 - 54
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (502 KB) |  | HTML iconHTML  

    This study addresses the problem of distributed XML queries in client-server architecture. Distributed XML documents can be large and complex. Due to the overhead involved in decomposing the queries, sending the decomposed queries to remote site(s), and executing structural join operations to compose the results, it can be difficult to rapidly execute queries on these distributed XML docs. We propose a query processor called XPCache to tackle those problems. We describe a Global Query Graph, a novel mechanism used by XPCache to classify queries based on their type and frequency. We then describe XPCache's mechanisms that exploit those classifications to improve query response time. Queries classified under the same type are given the same query optimization plan. These plans are cached at the central site. Queries classified as frequently used are answered from the central site cache, which improves query response time. The performance of XPCache is compared with another system and the results showing marked performance improvement. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Experimental Evaluation of the Adaptive Replica-assisted Migration for Parallel Storage Systems

    Page(s): 55 - 60
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (349 KB) |  | HTML iconHTML  

    We have proposed a method replica-assisted migration that use temporally replica data in other storage nodes during executing data migration to keep both qualities of service accesses and data migration duration. However, we have not evaluated the method with real workload including update operations. In this paper, we first improve the method and evaluate an efficiency of the method under file server workloads. Base on the result of it, we also propose adaptive replica-assisted migration for reduce migration duration. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing Semantic Loss during Query Reformulation in Peer Data Management Systems

    Page(s): 61 - 66
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (752 KB) |  | HTML iconHTML  

    In this paper we deal with the notion of semantic loss in peer data management systems (PDMS) queries. We define such a notion and we give a mechanism that discovers semantic loss in a PDMS network. Next, we propose an algorithm that addresses the problem of restoring such a loss. Further evaluation of our proposed algorithm is an ongoing work. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study on OLTP Performance Degradation by Structural Deterioration of Database

    Page(s): 67 - 72
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (521 KB) |  | HTML iconHTML  

    Database updates disorganize data stored physically in secondary storage, which is called structural deterioration and causes performance degradation. Online transaction processing (OLTP) is an essential data processing scheme for e-finance, e-commerce and so on. Conventional researches to improve OLTP performance lack a view from the aspect of preventing performance degradation due to structural deterioration. Recently, more and more business operations and services are being digitized then 24-hours-a-day operation of database is required. Needs for techniques to monitor structural deterioration and prevent performance degradation are increasing more and more. In this paper, we analyze how structural deterioration effects performance degradation in OLTP workload by using a benchmark. We also consider strategies of database mutations which are adaptive to workload and prevent structural deterioration from being accelerated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DB-Outlier Detection by Example in High Dimensional Datasets

    Page(s): 73 - 78
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (702 KB) |  | HTML iconHTML  

    Outlier detection is an important problem with applications in many fields. Such applications generally process high dimensional datasets. Among the existing methods of detecting outliers, Distance-Based outlier (DB-Outlier) detection is one of the most commonly used and simplest approaches, since it detects outliers only by calculating distances between data points. However, in high dimensional space, data is sparse, so every data point becomes a good outlier candidate. A Subspace-Based method has been proposed to deal with the curse of dimensions. It shows that meaningful outliers are likely to be identified by examining the behavior of data in low dimensional projections. On the other hand, most existing methods detect outliers with parameters being determined by users in advance. Such parameters usually contain hidden user view of outliers. Example-Based outlier detection methods are presented to be promising in discovering the hidden user view of outliers. In this paper, we discuss a new technique to detect DB-Outliers in high dimensional datasets based on user examples. Our proposed method makes use of Subspace-Based and Example-Based methods to discover a subspace where user examples are outstanding more significantly than in any other subspaces, and reports DB-Outliers detected in this subspace. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Problem-Solving Support System for Mathematical Sciences

    Page(s): 79 - 84
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1210 KB) |  | HTML iconHTML  

    In this paper, we present a problem-solving support system for mathematical sciences as a metasystem. We have implemented an integrated associative search for mathematical expressions and propose a GUI system which is suitable for use with this retrieval system. We present a prototype system with those systems we have implemented. The prototype system enables users' searching mathematical expressions and using a mathematical software with a unified interface. And we also present an experiment of a similarity expression search system to mathematical data on the Web. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method of Variable Ordering for Zero-suppressed Binary Decision Diagrams in Data Mining Applications

    Page(s): 85 - 90
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (659 KB) |  | HTML iconHTML  

    Recently, an efficient method of database analysis using zero-suppressed binary decision diagrams (ZBDDs) has been proposed. BDDs are a graph-based representation of Boolean functions, now widely used in system design and verification. Here we focus on ZBDDs, a special type of BDDs, which are suitable for handling large-scale combinatorial itemsets in transaction databases. The ZBDD size greatly depends on the variable ordering used. In this paper, we propose a new method of ZBDD variable ordering for itemset mining of large-scale transaction databases, and show experimental results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic and Personalized Curriculum-Generation Method Analysing Causality and Dependency between Learning Objects

    Page(s): 91 - 96
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (496 KB) |  | HTML iconHTML  

    In this paper, we show a dynamic and personalized curriculum generation method that analyses the causality and dependency between learning objects. This method calculates the strength and extracts the rules of causality and dependency between individual learning objects, described beforehand, using the results of testing, trends of understanding within a particular community, and definitions of learning objects with a learning order. This method determines the important learning objects for an individual user, and an order for effective learning, by analysing the results of an individual and those of a particular community. It dynamically computes changing relationships between learning objects and the learning situation of individual users, and enables generation of a personalized curriculum that supports effective learning. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Framework for Service-Based Query Resolution in eEnvironments

    Page(s): 97 - 102
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1093 KB) |  | HTML iconHTML  

    While recent works in P2P data management systems (PDMSs) have focused only on integrating traditional data sources, the access to an increasing number of data sources has been made in the form of data-providing Web services in P2P-based e-collaboration environments. In this paper, we supplement current PDMSs with capability to handle data sources exposed as services. In our solution we model data-providing services as RDF parametrized views. Then we devise an algorithm capable of composing the different data-providing services in order to answer a received query. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Retrieving Comparison Articles using Content Elements Order for News Archives

    Page(s): 103 - 110
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (911 KB) |  | HTML iconHTML  

    Video and text-news content have recently been broadcast on TV, newspapers, and the Internet. Although video content on out-of-date news is of little value for viewing, it can be considered to have value by comparing it to related content. Repeated news should especially be compared, e.g., the Olympic games and international expositions. We propose a method of retrieving comparison content based on the order of news elements. It is composed of two parts. The first is analysis of news content that someone is browsing. The second is the automatic generation of queries for retrieving content on comparison news. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context-dependent Route Generation Scheme Using Network Voronoi Diagrams

    Page(s): 111 - 115
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (941 KB) |  | HTML iconHTML  

    Researches on computing an optimal route according to user's preference or spatial contexts have been gaining focus recently, as car navigation and pedestrian navigation systems are getting accustomed to be used in daily lives. In this paper, the authors propose a method to compute a path to pass through as many context areas as possible along its route, according to the user's needs. Specifically, the authors apply the concept to construct a Delaunay diagram from neighbor nodes in Voronoi diagram, and use network Voronoi diagram to construct a subgraph based on contexts. For route search, the authors use A* shortest path algorithm over the subgraph. To verify the efficiency of the proposed method with subgraphs, the authors perform route search over subgraphs and base graph, which was generated from the road network of the real space, and compare the results. The results show that the route search by the proposed method consist of more paths with context areas than those performed over the base graph. Moreover, the proposed method reduces the number of steps for path search. View full abstract»

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