By Topic

Web Information Systems and Applications Conference (WISA), 2012 Ninth

Date 16-18 Nov. 2012

Filter Results

Displaying Results 1 - 25 of 58
  • [Cover art]

    Publication Year: 2012 , Page(s): C4
    Save to Project icon | Request Permissions | PDF file iconPDF (528 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2012 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (118 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2012 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (157 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2012 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (121 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2012 , Page(s): v - viii
    Save to Project icon | Request Permissions | PDF file iconPDF (153 KB)  
    Freely Available from IEEE
  • Message from the General Chairs

    Publication Year: 2012 , Page(s): ix
    Save to Project icon | Request Permissions | PDF file iconPDF (94 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Message from the Program Committee Chairs

    Publication Year: 2012 , Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (93 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Committee Organization

    Publication Year: 2012 , Page(s): xi - xii
    Save to Project icon | Request Permissions | PDF file iconPDF (127 KB)  
    Freely Available from IEEE
  • Program Committee Members and Reviewers

    Publication Year: 2012 , Page(s): xiii - xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (114 KB)  
    Freely Available from IEEE
  • An Extended Continuous Uncertain XML Data Model Research

    Publication Year: 2012 , Page(s): 3 - 8
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (228 KB) |  | HTML iconHTML  

    The data model is one of the core problems in the field of XML data management, but at present the research on management of uncertain data supporting multi-dimensional continuous random variables has been limited. An extended data model supporting multi-dimensional continuous random variables was proposed based on the existing model. The new model made the continuous uncertain XML no longer confined to express one dimension. In addition, queries about joint probability and conditional probability on the model were defined, The query strategy also can choose appropriate characteristic value calculation method according to different continuous distribution types, thus improve the query processing efficiency largely. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Deep Web Database Sampling Method Based on High Correlation Keywords

    Publication Year: 2012 , Page(s): 9 - 14
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (400 KB) |  | HTML iconHTML  

    Evaluation of the Deep Web data sources must be based on the data in the Web databases, then how to select the most representative keywords as a query word to obtain a large number of uniformly distributed data is a major difficulty, this paper proposed a Deep Web database sampling method based on high correlation keyword, using a graph based keyword-connected network to get query words, the method can get a random sample of high-quality data from the Deep Web data source more efficiently. View full abstract»

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

    Publication Year: 2012 , Page(s): 15 - 20
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (205 KB) |  | HTML iconHTML  

    With the rapid growing popularity of XML to represent data, how to make good use of XML data in relational databases is worthy of study. Storing XML data as text in relational databases is a traditional strategy which cannot reflect the feature of XML format. In this paper, a mechanism for XML data storage and query in relational databases is proposed. XML data can be stored in relational tables and XQuery expressions can be evaluated as a part of SQL for XML data query. XQuery grammar tree and Query tree model for XML data query in rela-tional databases is presented to gain more efficient performance while querying XML data. Appropriative algorithm for evaluating XPath is also presented in this paper by which XQuery can be evaluated rapidly and efficiency. Finally, experiments invalidate the strategy of XML storage and run the algorithm on real XML datasets to show the efficiency compared with other mechanisms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Investigations on XML-based Data Exchange between Heterogeneous Databases

    Publication Year: 2012 , Page(s): 21 - 24
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (152 KB) |  | HTML iconHTML  

    With the growing of the Internet, lots of heterogeneous relational databases are built in distributed environment. Data exchange between these databases absorbs more attention of researchers and engineers nowadays than ever. As a well-formed makeup language, XML is suitable to store and transfer information. Therefore we investigate the data exchange method via XML in this paper. We analyze mapping techniques between XML schema and relational database. Then, an effective method for data exchange is described in detail. Finally we design and implement a data exchange system by Java and DOM interface technology. It works well in a real commercial web application. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Layout-Conscious Optimization: Beyond Hybrid Row-Column Storage Model

    Publication Year: 2012 , Page(s): 25 - 28
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (305 KB) |  | HTML iconHTML  

    Hybrid row-column storage model [1][4], a common database approach for both OLTP and OLAP, have attracted a lot of attention in the past few years. Previous works about hybrid row-column approach mainly focus on physical storage. In this paper, we propose the idea of Layout-Conscious Optimization(LCO), techniques that fully exploits possibilities and take advantages of hybrid row-column data layout in all layers of DBMS, e.g., physical storage, query processing as well as network transfer. We believe LCO offer new opportunities to improve the performance of DBMS. To demonstrate the power of LCO, we present the design of a row-column hybrid network transfer protocol for DBMS, which reduces data transfer by 75% while incurs little extra cost on CPU. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel URL Assignment Model Based on Multi-objective Decision Making Method

    Publication Year: 2012 , Page(s): 31 - 34
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (205 KB) |  | HTML iconHTML  

    With the tremendous growth of the Web, it has become a huge challenge for the single-process crawlers to locate the resources that are precise and relevant to some topics in an appropriate amount of time, so it is increasingly important to use the parallel crawler. However, due to the parallelism of crawlers, one headache problem we have to face is how to distribute the URLs to crawlers to make the parallel system work coordinately and thereby make sure that the Web pages fetched are of high quality. In this paper, a novel URL assignment model for the parallel crawler is described, which is based on multi-objective decision making method and considers multiple factors synthetically such as load balance, overlap and so on. Extensive experiments test and validate our techniques. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach for Crawling Dynamic WebPages Based on Script Language Analysis

    Publication Year: 2012 , Page(s): 35 - 38
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (197 KB) |  | HTML iconHTML  

    Traditional Web crawlers use one or more URLs of the initial Webpages to extract new URLs continuously, and then access data of the pages. AJAX, as one of the core technologies of Web2.0, greatly enhances the response efficiency of Web applications, brings good user experience, and therefore has been widely used. However, due to the use of AJAX techniques shatters the architecture of traditional Web pages which is based on static pages, the traditional Web crawlers cannot meet the challenges of dynamic partial refresh and asynchronous loading. In this paper, we propose an efficient approach for the information in dynamic pages by analyzing script language, and use path repository and judge the page refreshing state to improve the accuracy and efficiency of the algorithm. Experimental evaluation shows the efficiency and effectiveness of our approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Automatic Discovering for a Real-World RESTful Web Service

    Publication Year: 2012 , Page(s): 39 - 42
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (227 KB) |  | HTML iconHTML  

    Web services have been emerging and are by now one of the most popular techniques for building versatile distributed systems. With the increasing popularity of the Restful Web services on the network, how to select the real-world Restful Web services accurately from the ordinary web pages, thus increase the need for services discovering. In this paper, based on the researches of the SOAP-based Web services and Restful services, we develop a service pattern discovery system for the Restful Web services, and introduce the research on the service feature selecting and services classification. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Variable Granularity User Classification Algorithm Based on Multi-dimensional Features of Users

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

    Classifying Web users based on multi-dimensional features is one of the foundations of realizing personalized Web applications. It could be used for user classification model, users' multi-dimensional data analysis, potential user group discovery and personalized recommendation and so forth. In this paper, a variable granularity user classification algorithm based on Web users' multidimensional features is proposed. Given a user feature model, the algorithm will mine all common feature categories and find the relationships between them. A series of experiments are conducted to analyze the performances of this algorithm with different condition. The experimental results indicate that this algorithm has good performance and can be deployed in Web applications with massive Web users. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Composite Events Detecting Approach Based on Similar Sub-events

    Publication Year: 2012 , Page(s): 49 - 53
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (161 KB) |  | HTML iconHTML  

    RFID technologies are applied extensively in Cyber-Physical Systems (CPS). RFID system collects, filters, and integrates large volume of events gathered continuously by readers to process composite event detections from applications. When the system processes many composite events, detection sharing is quite important for their execution and enhancing the performance of the system. In this paper, we propose a composite event detecting approach based on similar sub-event for RFID event streams. In order to achieve it, we propose the concept of small event by analyzing the different composite event and the relationship between operators, give the rules and properties of composite event rewriting, and give an approach of small event sharing and an implementation strategy for sharing similar sub-events. Finally, we demonstrate the effectiveness of our approach through a detail performance analysis of our algorithm implementation as well as through a comparison to a typical detection algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hybrid Search Engine Framework for the Internet of Things

    Publication Year: 2012 , Page(s): 57 - 60
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (273 KB) |  | HTML iconHTML  

    Efficient retrieval of dynamically generated, spatial-temporal, and heterogeneous sampling data in the Internet of Things is a key challenge in recent years. However, current search engine techniques are not suitable for such kind of data. To solve this problem, we propose a Hybrid Search Engine Technique for the Internet of Things based on Spatial-Temporal, Value-based, and Keyword-based Conditions ("IoT-SVK Search Engine"), in this paper. The IoT-SVK search engine has satisfactory performances in supporting multi-modal retrieval conditions, and thus provides a good solution for real-time searching of massive sampling data in the Internet of Things. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Answering Multiple Queries in Compressed Texts

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

    With the exponential increment of data, compression technology becomes an important tool in the field of data management, especially in text management. An increasing pressing challenge is how to efficiently query these massive amounts of sequence data in their compressed format. In this paper we study the problem of answering subsequence-search queries on LZ78 format of texts. We propose the concept of conditional common sub strings of queries to improve query performance. We present a techniques to find minimal conditional common sub strings in compressed text and a local uncompressing technique to verify and locate positions of answers in text. Finally, the experimental results over real data demonstrate the efficiency of our algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Product Recommendation Based on Search Keywords

    Publication Year: 2012 , Page(s): 67 - 70
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (173 KB) |  | HTML iconHTML  

    Recommender systems have been widely deployed on E-commerce websites. The cold start problem of making effective recommendations to new users without any historical data on the website is still challenging. These new users often have some available information, such as search keywords, before visiting the website. It is natural to use the information to predict users' preference, such that an immediate recommendation is possible. In this paper, we propose a new product recommendation approach for new users based on the implicit relationships between search keywords and products. The relationships between keywords and products are represented in a graph and relevance of keywords to products is derived from attributes of the graph. The relevance information will be utilized to predict preferences of new users. A preliminary experiment is conducted and shows that our approach outperforms the traditional approach (Recommending Most Popular Products). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach for Personalized Tag Recommendation Based on Interest Transfer Model

    Publication Year: 2012 , Page(s): 71 - 74
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (254 KB) |  | HTML iconHTML  

    Recently, social tagging systems become more and more popular in many Web 2.0 applications. In such systems, Users are allowed to annotate a particular resource with a freely chosen a set of tags. These user-generated tags can represent users' interests more concise and closer to human understanding. Interests will change over time. Thus, how to describe users' interests and interests transfer path become a big challenge for personalized recommendation systems. In this approach, we propose a variable-length time interval division algorithm and user interest model based on time interval. Then, in order to draw users' interests transfer path over a specific time period, we suggest interest transfer model. After that, we apply a classical community partition algorithm in our approach to separate users into communities. Finally, we raise a novel method to measure users' similarities based on interest transfer model and provide personalized tag recommendation according to similar users' interests in their next time intervals. Experimental results demonstrate the higher precision and recall with our approach than classical user-based collaborative filtering methods. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dual Hashtables Algorithm for Durable Top-k Search

    Publication Year: 2012 , Page(s): 75 - 80
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (252 KB) |  | HTML iconHTML  

    We propose a dual hash tables algorithm which can realize the durable top-k search. Two hash tables are constructed to keep the core information, such as score and time in the inverted lists. We use the key-value relationships between the two hash tables to calculate the scores which measure the correlations between a keyword and documents, and search the versioned objects that are consistent in the top-k results throughout a given query interval. Finally, we use data from Wikipedia to demonstrate the efficiency and performance of our algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling of Parallel Interactive Modes among Collaborative Processes Based on High Level Petri Nets

    Publication Year: 2012 , Page(s): 83 - 86
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (208 KB) |  | HTML iconHTML  

    As the development of collaborative applications, the parallel interactions among processes are more and more complicated and frequent. However, modeling of the interactions among many collaborative processes is a complicated and error-prone procedure. In this paper, firstly, a novel model based on Petri net, called PIPN, was proposed. PIPN is suitable to define and analyze the parallel interactions among collaborative processes. Secondly, seven parallel interactive modes were summarized according to three views of parallel interactions, which are unidirectional or bidirectional, single-point or multi-point, and synchronous or asynchronous. Then the formal definitions and control flow graphs of these modes were given. Finally, an example, called micro blog, was modeled to verify the reasonableness and feasibility of the work in this paper. View full abstract»

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