11850990
Network Traffic Reduction by Hypertext Compression
This paper proposes a three-step process to reduce the size of hypertext documents for reducing the network traffic on the Internet. With the explosive growth in the number of users on the Internet, the bandwidth demand has grown tremendously. Before the improvement of network infrastructures can meet the demand, this paper addresses the problem by reducing the size of HTML documents that currently occupies majority of the network traffic on the Internet. The proposed process consists of three steps: (1) shrinking HTML documents by removing data that will not alter the appearance and the function, (2) encoding HTML documents by representing most frequent used tags and words with single bytes, and (3) compressing HTML documents by using standard compression utilities. Our test results show that the proposed process achieves a reduction ratio of 81% on average. We also developed a browser plug-in program that provides transparent access for the users when viewing the reduced-size HTML documents. With the plug-in program, the users will not see any differences when viewing the reduced-sized HTML documents comparing to the original ones. They will, however, experience a reduction in retrieval latency on average of 15%.
17009479
Bidirectional hierarchical clustering for Web mining
We propose a new bidirectional hierarchical clustering system for addressing challenges of Web mining. The key feature of the approach is that it aims to maximize the intra-cluster similarity in the bottom-up cluster-merging phase and it ensures to minimize the inter-cluster similarity in the top-down refinement phase. This two-pass approach achieves better clustering than existing one-pass approaches. We also propose a new cluster-merging criterion for allowing more than two clusters to be merged in each step and a new measure of similarity for taking into consideration not only the inter-connectivity between clusters but also the internal connectivity within the clusters. These result in reducing the average complexity for creating the final hierarchical structure of clusters from O(n/sup 2/) to O(n). The hierarchical structure represents a semantic structure between concepts of clusters and is directly applicable to the future of semantic net.
6302139
Speeding up keyword search for search engines
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important operations in search engines and numerous other applications. In this paper we propose a new text indexing technique for improving the performance of keyword search. Our proposed technique not only speeds up searching operations but also the operations for inserting and for deleting keywords, which are particularly important for the ever increasing and dynamic changing databases such as that for search engines. We propose to partition all
7584097
An Adaptive Web Cache Access Predictor Using Neural Network
This paper presents a novel approach to successfully predict Web pages that are most likely to be re-accessed in a given period of time. We present the design of an intelligent predictor that can be implemented on a Web server to guide caching strategies. Our approach is adaptive and learns the changing access patterns of pages in a Web site. The core of our predictor is a neural network that uses a backpropagation learning rule. We present results of the application of this predictor on static data using log files; it can be extended to learn the distribution of live Web page access patterns. Our simulations show fast learning, uniformly good prediction, and up to 82% correct prediction for the following six months based on a one-day training data. This long-range prediction accuracy is attributed to the static structure of the test Web site.
1825969
Agent space architecture for search engines
The future of computing is moving from individual processing units to communities of self organizing agents. In This work we propose an agent and network based architecture for parallel and distributed computing called agent space architecture. Our architecture builds upon the notions of agent and object space and utilizes multicast networks. The building blocks for our proposed architecture consist of an active processing unit called agent, a shared place for communication called space, and a communication medium called multicast network. One unique feature of our architecture is that we extend the concept of object space to become an active space. Our active space functions as a rendezvous, a repository, a cache, a responder, a notifier, and a manager of its own resources. The organization of our architecture is as general as network topology. Any number of agents, spaces, or networks can be added to achieve high performance. It is as scalable as Ethernet and adding agents or spaces is as easy as plug and play. High availability and fault tolerance is achieved through multiple agents, spaces, and networks. All these features are particularly beneficial for challenging applications such as search engine, which is used as a test case to implement and to test our proposed architecture.
10179927
Automatic web page classification in a dynamic and hierarchical way
Automatic classification of web pages is an effective way to deal with the difficulty of retrieving information from the Internet. Although there are many automatic classification algorithms and systems that have been proposed, most of them ignore the conflict between the fixed number of categories and the growing number of web pages going into the system. They also require searching through all existing categories to make any classification. We propose a dynamic and hierarchical classification system that is capable of adding new categories as required, organizing the web pages into a tree structure, and classifying web pages by searching through only one path of the tree structure. Our test results show that our proposed single-path search technique reduces the search complexity and increases the accuracy by 6% comparing to related algorithms. Our dynamic-category expansion technique also achieves satisfying results on adding new categories into our system as required.
6255541
Dynamic resource discovery for applications survivability in distributed real-time systems
We propose a new resource discovery protocol, REALTOR, which is based on a combination of pull-based and push-based resource information dissemination. REALTOR has been designed for real-time component-based distributed applications in very dynamic or adverse environments. REALTOR supports survivability and information assurance by allowing the migration of components to safe locations under emergencies like external attack, malfunction, or lack of resources. Simulation studies show that under normal and heavy load conditions REALTOR remains very effective in finding available resources with a reasonably low communication overhead. REALTOR: 1) effectively locates resources under highly dynamic conditions, 2) has an overhead that is system-size independent, and 3) works well in highly adverse environments. We evaluate the effectiveness of a REALTOR implementation as part of Agile Objects, an infrastructure for real-time capable, highly mobile Java components.
30747196
Addressing a standards creation process: a focus on ebXML
Current trends in e-business are creating opportunities for automation of business processes across business boundaries. However, lack of standards has caused difficulties for industry players in exploiting resources and coordinating activities in the context of e-business. ebXML--an emerging e-business standard framework to unite competing factions under a banner of international trade--has been developed within an industry consortium using an open, collaborative process with no barriers to entry, whose approach is very different from traditional approach to create standards. Drawing on socio-technological perspective, this paper attempts to gain deeper understanding of such phenomenon by using a case study methodology. This paper uses data drawn mostly from email discussions and minutes of teleconference and face-to-face meeting. Our exploration of the ebXML standardization process generates specific propositions. In summary, our analysis found that the 'openness' of standardization process helps to create a more comprehensive standard than proprietary standards--effectively leading to convergence of technologies, and that the unfolding dynamics of standardization process varies depending on the characteristics of standards to be developed. We also discuss user participation as an important factor that influences the dynamics of standardization process in such an open, collaborative standardization process. Surprisingly, user participation seems to be more effective in creating technical infrastructure oriented standards rather than business process oriented standards.
11364385
An organizational memory for facilitating knowledge: an application to e-business architecture
Abstract Our economy is increasingly dependent on knowledge. Organizational memory (OM) contains knowledge that companies need to manage. This paper proposes a knowledge facilitating organizational memory (KFOM) to decipher a harmony mechanism of OM from the Oriental Yin and Yang perspective. KFOM clarifies an architecture to catapult the OM to organizational effectiveness. This architecture is made up of two layers: storage layer and facilitation layer. Storage layer represents task and domain knowledge. Facilitation layer identifies the harmony mechanism for utilizing knowledge. This harmony mechanism leverages the knowledge chain with agent, collaborator, transactor, object and registry facilitators. In order to demonstrate its practical usefulness, we explore how KFOM can sharpen an international e-business technical standard. Furthermore, an extension to a real-life B2B collaboration project for Korean steel and automotive companies confirms that KFOM can lead to business practices which most knowledge-oriented companies can adopt.
42601258
On the Optimality of Holistic Algorithms for Twig Queries
Streaming XML documents has many emerging applications. However, in this paper, we show that the restrictions imposed by data streaming are too restrictive for processing twig queries – the core operation for XML query processing. Previous proposed algorithm TwigStack is an optimal algorithm for processing twig queries with only descendent edges over streams of nodes. The cause of the suboptimality of the TwigStack algorithm is the structurally recursions appearing in XML documents. We show that without relaxing the data streaming model, it is not possible to develop an optimal holistic algorithm for twig queries. Also the computation of the twig queries is not memory bounded. This motivates us to study two variations of the data streaming model: (1) offline sorting is allowed and the algorithm is allowed to select the correct nodes to be streamed and (2) multiple scans on the data streams are allowed. We show the lower bounds of the two variations.
15301775
Implementing Xquery 1.0: The Galax Experience
Galax is a light-weight, portable, open-source implementation of XQuery 1.0. Started in December 2000 as a small prototype designed to test the XQuery static type system, Galax has now become a solid implementation, aiming at full conformance with the family of XQuery 1.0 specifications. Because of its completeness and open architecture, Galax also turns out to be a very convenient platform for researchers interested in experimenting with XQuery optimization. 
 
We demonstrate the Galax system as well as its most advanced features, including support for XPath 2.0, XML Schema and static type-checking. We also present some of our first experiments with optimization. Notably, we demonstrate query rewriting capabilities in the Galax compiler, and the ability to run queries on documents up to a Gigabyte without the need for preindexing. Although early versions of Galax have been shown in industrial conferences over the last two years, this is the first time it is demonstrated in the database community.