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
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.
38524318
Making Sense of Search Results by Automatic Web-page Classifications
This paper reports the development of a system for automatically organizing Internet web pages into meaningful categories. The aim of the system is to allow Internet users to find useful information in less time. The current problem with using the Internet is how to find the information that we need. With the explosive growth in the Internet, the information overload situation is getting worse. The proposed system automatically classifies web pages based on three types of information: (1) The system analyzes organizational information among web pages (inter-web-page relationship), such as an URL and links within a web page. (2) It analyzes the meta-web-page information such as data contained in META tags and formatting data of a web page. And (3), it analyzes web-page-content information such as keywords and phrases in the content of a web page. Our results show that combining all three types of information provides better accuracy.
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.
60699961
Cache-Conscious Automata for XML Filtering
Hardware cache behavior is an important factor in the performance of memory-resident, data-intensive systems such as XML filtering engines. A key data structure in several recent XML filters is the automaton, which is used to represent the long-running XML queries in the main memory. In this paper, we study the cache performance of automaton-based XML filtering through analytical modeling and system measurement. Furthermore, we propose a cache-conscious automaton organization technique, called the hot buffer, to improve the locality of automaton state transitions. Our results show that 1) our cache performance model for XML filtering automata is highly accurate and 2) the hot buffer improves the cache performance as well as the overall performance of automaton-based XML filtering
10012054
A development environment for customer-oriented Internet business: eBizBench
Abstract An important challenge in the age of Internet business is the proper alignment of customers’ needs with the business system. In order to improve an Internet business system according to customers’ needs continuously, reuse of design results is of particular importance. This paper proposes a development environment, called eBizBench, which provides support for this alignment and reusability. The eBizBench includes seven functions: (1) project management, (2) customer analysis, (3) value analysis, (4) web design, (5) implementation design, (6) repository management, and (7) repository. The eBizBench can help develop and maintain Internet business systems in a systematic fashion. The repository is useful for the conversion of design results among development environments. A real-life web site is illustrated to demonstrate the usefulness of the eBizBench.
13929475
Effects of Web retail service quality and product categories on consumer behavior: a research model and empirical exploration
This paper explores how Web retail service quality at the point of purchase influences consumers' perceptions of value and willingness to buy. In particular, this study highlights how Web retail service quality has different effects on perceived product quality, value, and willingness to buy according to product categories. We provide a research model on the basis of service quality, product categories on the Web, and marketing theories for consumers' purchase behavior. Consumer perceptions of Web retail service quality are collected from a sample of shoppers who actively search for products over the Internet. The results imply that functional Web retail service quality has a direct effect on willingness to buy and technical Web retail service quality influences consumer perceptions of product quality and value. Furthermore, product categories moderate the relationships among Web retail service quality, perceived product quality, perceived value, and willingness to buy. Implications for Internet marketing and future research directions are discussed.
17095732
Incremental evaluation of schema-directed XML publishing
When large XML documents published from a database are maintained externally, it is inefficient to repeatedly recompute them when the database is updated. Vastly preferable is incremental update, as common for views stored in a data warehouse. However, to support schema-directed publishing, there may be no simple query that defines the mapping from the database to the external document. To meet the need for efficient incremental update, this paper studies two approaches for incremental evaluation of ATGs [4], a formalism for schema-directed XML publishing. The reduction approach seeks to push as much work as possible to the underlying DBMS. It is based on a relational encoding of XML trees and a nontrivial translation of ATGs to SQL 99 queries with recursion. However, a weakness of this approach is that it relies on high-end DBMS features rather than the lowest common denominator. In contrast, the bud-cut approach pushes only simple queries to the DBNS and performs the bulk of the work in middleware. It capitalizes on the tree-structure of XML views to minimize unnecessary recomputations and leverages optimization techniques developed for XML publishing. While implementation of the reduction approach is not yet in the reach of commercial DBMS, we have implemented the bud-cut approach and experimentally evaluated its performance compared to recomputation.