Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.最新文献

{"title":"An update-risk based approach to TTL estimation in Web caching","authors":"Jeong-Joon Lee, K. Whang, B. Lee, Ji-Woong Chang","doi":"10.1109/WISE.2002.1181640","DOIUrl":"https://doi.org/10.1109/WISE.2002.1181640","url":null,"abstract":"Web caching is an important technique for accelerating Web applications and reducing the load on the Web server and the network through local cache accesses. As in traditional data caching, Web caching poses the well-recognized problem of maintaining cache consistency. Web caching, however, has the advantage of delaying the refreshment of caches when the Web server updates the original data, i.e., Web caching tries to get better performance allowing tolerable inconsistency. This weak consistency requirement introduced the concept of time-to-live (TTL: the time during which the cached data item is expected to be valid) in the face of future updates. Subsequently, a number of methods have been invented to have the cache server estimate the TTL. However, the two well-known TTL estimation methods - the fixed TTL method and the heuristic method - do not allow intuitive understanding of the estimation processes and lack theoretical reasoning behind them, disallowing administrators from configuring the cache server by their intention. To mend these deficiencies, we propose the update-risk based TTL estimation method. This method uses a formal, yet intuitive, approach based on probabilistic analysis. In the proposed method, users provide the update risk as the probability that the original data will be updated within the estimated TTL. Then, based on our model, the cache server calculates the value of TTL using the update risk. The results of our experiments, performed using logs of a real cache server, show experimentally that the measured update risk closely matches that used to estimate TTL. Moreover, the notion of update risk is clear in its intention and semantics. These confirm the superiority of our method to conventional ones. We also show the impact of update risk on performance and consistency in order to help administrators select an appropriate value for update risk to obtain performance and consistency desired. In addition, we reassess the two aforementioned conventional methods in light of our method.","PeriodicalId":392999,"journal":{"name":"Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133152513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Online and incremental mining of separately-grouped Web access logs","authors":"Y. Woon, W. Ng, Ee-Peng Lim","doi":"10.1109/WISE.2002.1181643","DOIUrl":"https://doi.org/10.1109/WISE.2002.1181643","url":null,"abstract":"The rising popularity of electronic commerce makes data mining an indispensable technology for business competitiveness. The World Wide Web provides abundant raw data in the form of Web access logs, Web transaction logs and Web user profiles. Without data mining tools, it is impossible to make any sense of such massive data. We focus on Web usage mining because it deals most appropriately with understanding user behavioral patterns which is the key to successful customer relationship management. Previous work dealt separately with specific issues of Web usage mining and made assumptions without taking a holistic view and thus, had limited practical applicability. We formulate a novel and more holistic version of Web usage mining termed transactionized logfile mining (TRALOM) to effectively and correctly identify transactions as well as to mine useful knowledge from Web access logs. We also introduce a new data structure, called the WebTrie, to efficiently hold useful preprocessed data so that TRALOM can be done in an online and incremental fashion. Experiments conducted on real Web server logs verify the usefulness and practicality of our proposed techniques.","PeriodicalId":392999,"journal":{"name":"Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127990870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Database support for spatial generalisation for WWW and mobile applications","authors":"Xiaofang Zhou, S. Prasher, M. Kitsuregawa","doi":"10.1109/WISE.2002.1181660","DOIUrl":"https://doi.org/10.1109/WISE.2002.1181660","url":null,"abstract":"The need for using spatial vector data for Web-based and mobile applications has been increasing rapidly. Vector spatial data is difficult to generalise (that is, to derive a suitable level of detail, or LoD, of the data for a given application). In a client-server environment, excessive details of spatial data cannot always be appreciated on the client side, but could consume a significant amount of resources on both the server and the client side, not to mention the extra cost of data transfer. Spatial data generalisation has been investigated extensively in the area of cartography. Most cartographical generalisation algorithms, however, are post-query operations where all the data, including unneeded data, is retrieved from the database for simplification. We incorporate spatial data simplification algorithms into query processing within DBMS. This novel approach targets primarily Web-based and mobile spatial applications that stand to benefit from early data reduction. Experiments on real data reveal significant performance improvements for our approach.","PeriodicalId":392999,"journal":{"name":"Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126944709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimized translation of XPath into algebraic expressions parameterized by programs containing navigational primitives","authors":"S. Helmer, C. Kanne, G. Moerkotte","doi":"10.1109/WISE.2002.1181658","DOIUrl":"https://doi.org/10.1109/WISE.2002.1181658","url":null,"abstract":"We propose a new approach for the efficient evaluation of XPath expressions. This is important, since XPath is not only used as a simple, stand-alone query language, but is also an essential ingredient of XQuery and XSLT. The main idea of our approach is to translate XPath into algebraic expressions parameterized with programs. These programs are mainly built from navigational primitives like accessing the first child or the next sibling. The goals of the approach are: 1) to enable pipelined evaluation, 2) to avoid producing duplicate (intermediate) result nodes, 3) to visit as few document nodes as possible, and 4) to avoid visiting nodes more than once. This improves the existing approaches, because our method is highly efficient.","PeriodicalId":392999,"journal":{"name":"Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121554791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Processing XML view queries including user-defined foreign functions on relational databases","authors":"Y. Ishikawa, Jun Kawada, H. Kitagawa","doi":"10.1109/WISE.2002.1181659","DOIUrl":"https://doi.org/10.1109/WISE.2002.1181659","url":null,"abstract":"With the increased popularity of XML, XML publishing of RDBs has been attracting a lot of research interest. One of the typical approaches is to use a middleware system to render XML views over RDBs and to allow users to access data with XML query languages such as XQuery. The query processing is done efficiently by making the best of the querying power of RDBMSs. Namely, XML queries are translated into SQL queries and tagging operations, which are processed by the RDBMSs and middleware, respectively. In some XML query languages including XQuery, use of user-defined foreign functions is enabled or planned as an extension feature to cope with domain dependent semantics. Foreign functions are defined for XML fragments, and their implementations are often given by codes in a general programming language. The existing query processing schemes on XML views do not consider cases where foreign functions are included in XML queries. We propose extended schemes to process XML queries in such cases. In the proposed schemes, the middleware takes care of processing foreign functions as well as tagging operations. Therefore, the proposed schemes are applicable to XML views on commonly available RDBMSs. Three types of query processing schemes are proposed, and their performance is studied with experiments.","PeriodicalId":392999,"journal":{"name":"Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126278365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A stochastic approach for modeling and computing Web communities","authors":"G. Greco, S. Greco, E. Zumpano","doi":"10.1109/WISE.2002.1181642","DOIUrl":"https://doi.org/10.1109/WISE.2002.1181642","url":null,"abstract":"In the last few years, a lot of research has been devoted to developing new techniques for improving the recall and precision of current Web search engines. Few works deal with the interesting problem of identifying the communities to which pages belong. Most previous approaches tried to cluster data by means of spectral techniques or traditional hierarchical algorithms. The main problem with these techniques is that they ignore the fact that Web communities are social networks with distinctive statistical properties. We analyze Web communities on the basis of the evolution of an initial set of hubs and authoritative pages. The evolution law captures the behaviour of page authors with respect to the popularity of existing pages for topics of interest. Assuming such a model, we have found interesting properties of Web communities and have proposed a technique for computing relevant properties for specific topics. Several experiments have confirmed the validity of both the model and the identification method.","PeriodicalId":392999,"journal":{"name":"Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.","volume":"42 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125709086","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"From marketplaces to web services","authors":"M. Hsu","doi":"10.1109/WISE.2002.1181638","DOIUrl":"https://doi.org/10.1109/WISE.2002.1181638","url":null,"abstract":"To enable intra- and inter-enterprise application integration, enterprises have invested heavily in EAI (Enterprise Application Integration) and B2B (Business to Business) technologies. However, the first generation B2B technologies, represented by the Marketplace platform and its associated tools and applications offered in the mid to late 1990s, have left much to be desired. Recent momentum in Web Services based on the SOAP, WSDL, and UDDI specifications promises a standardized connectivity at a lower cost that would transform the business connectivity paradigm. In this talk, we will provide an anatomy and diagnosis of the B2B technologies. We will also analyze the current Web service specifications and technologies from the perspectives of protocol layers, service descriptions, and business service registries. We will describe the problems that must be solved in order for Web services to evolve from its simplistic form today to enable the vision of dynamic business process integration within and across enterprise boundaries.","PeriodicalId":392999,"journal":{"name":"Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134305521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Ontology-based automatic classification for Web pages: design, implementation and evaluation","authors":"R. Prabowo, M. Jackson, P. Burden, Heinz D. Knoell","doi":"10.1109/WISE.2002.1181655","DOIUrl":"https://doi.org/10.1109/WISE.2002.1181655","url":null,"abstract":"In recent years, we have witnessed continual growth in the use of ontologies in order to provide a mechanism to enable machine reasoning. This paper describes an automatic classifier, which focuses on the use of ontologies for classifying Web pages with respect to Dewey Decimal Classification (DDC) and Library of Congress Classification (LCC) schemes. Firstly, we explain how these ontologies can be built in a modular fashion, and mapped into DDC and LCC. Secondly, we propose the formal definition of a DDC-LCC and an ontology-classification-scheme mapping. Thirdly, we explain the way the classifier uses these ontologies to assist classification. Finally, an experiment in which the accuracy of the classifier was evaluated is presented. The experiment shows that our approach results an improved classification in terms of accuracy. This improvement, however, comes at a cost in a low coverage ratio due to incompleteness of the ontologies used.","PeriodicalId":392999,"journal":{"name":"Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133190186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Fuzzy cognitive agents for personalized recommendation","authors":"C. Miao, Qiang Yang, H. Fang, A. Goh","doi":"10.1109/WISE.2002.1181672","DOIUrl":"https://doi.org/10.1109/WISE.2002.1181672","url":null,"abstract":"There is an increasing need for various Web-service, e-commerce and e-business sites to provide personalized recommendations to on-line customers. This paper proposes a new type of personalized recommendation agents called fuzzy cognitive agents. Fuzzy cognitive agents are designed to give personalized suggestions based on the user's current personal preferences, other user's common preferences, and an expert's domain knowledge. Fuzzy cognitive agents are able to represent knowledge via extended fuzzy cognitive maps, learn users' preferences from most recent cases, and help customers make inferences and decisions through numeric computation instead of symbolic and logic deduction. A case study is included to illustrate how personalized recommendations are made by fuzzy cognitive agents in e-commerce sites. The case study demonstrates that the fuzzy cognitive agent is both flexible and effective in supporting e-commerce applications.","PeriodicalId":392999,"journal":{"name":"Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129450976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Extended faceted taxonomies for Web catalogs","authors":"Yannis Tzitzikas, N. Spyratos, P. Constantopoulos, A. Analyti","doi":"10.1109/WISE.2002.1181656","DOIUrl":"https://doi.org/10.1109/WISE.2002.1181656","url":null,"abstract":"Indexing and retrieval in Web catalogs can benefit from using faceted taxonomies. A faceted taxonomy consists of a set of facets, where each facet consists of a predefined set of terms structured by a subsumption relation. We propose two extensions of faceted taxonomies, which allow inferring conjunctions of terms that are valid in the underlying domain. We give a model-theoretic interpretation to these extended faceted taxonomies and we provide mechanisms for inferring the valid conjunctions of terms. This inference service can be exploited for preventing errors during the indexing process and for dynamically generating navigation trees that are suitable for browsing through the Web. The proposed scheme has several advantages by comparison to the hierarchical classification schemes that are currently employed by Web catalogs, namely: (a) conceptual clarity: it is easier to understand; (b) compactness: it takes less space; and (c) scalability: the update operations can be formulated easier and be performed more efficiently.","PeriodicalId":392999,"journal":{"name":"Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002.","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117118740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}