Theoretical Legitimacy of ‘Strategic Entrepreneurship’: How does a firm engage in entrepreneurial exploration as well as strategic consolidation?

Theoretical legitimacy of ‘strategic management’ has not yet been established. This exploratory theoretical paper revisits the connection between entrepreneurship and strategy. Examining data of decisions in two firms across their initial years, one of which sold to a larger buyer and the other did not, this paper attempts to trace the firms’ path in navigating the tension between entrepreneurial exploration necessary for initial growth on the one hand, and strategic direction, on the other, through building efficiency routines necessary for profitable exploitation. Preliminary results and implications are discussed

Mobile Data Management

The management of data in the mobile computing environment offers new challenging problems. Existing software needs to be upgraded to accommodate this environment. To do so, the critical parameters need to be understood and defined. We have surveyed some problems and existing solution

Controlling Web Query Execution in a Web Warehouse

Most of the contemporary Web query systems have limited capabilities in controlling Web query execution. Such query facility is important as it gives us an opportunity to optimize the evaluation of a Web query. We address this issue in the context of our Web warehousing system called WHOWEDA (Warehouse Of Web Data). Specifically, we investigate different types of constraints (related to query execution) which may be imposed on a Web query such as number of query results, time of execution, restrict the evaluation of a query to specified set of Web sites, etc. An important feature of our approach is that it attempts to address the query evaluation issues which may arise due to the existence of broken links and forms in the Web

Association Rules for Web Data Mining in WHOWEDA

The authors discuss association rules which can be discovered from Web data. The association rules are discussed within the scope of our WHOWEDA (warehouse of Web data) project. WHOWEDA is supported by a Web data model and a set of algebraic operators. The Web data model allows a uniform and integrated view of Web data gathered using a user\u27\u27s query graph. A user\u27\u27s query graph describes the query by example (what the user perceives as the query) and the Web coupling query gathers instances of such a query graph from the Web and stores them in the form of subgraphs (called Web tuples) in a Web table. We discuss association rules within this domain. An association rule defines an association between the nodes and links attributes of Web tuples within a Web table. There are two different classes of association rules that can be developed from data in a Web table. There are two different classes of association rules that can be developed from data in a Web table. Node-to-node associations are those rules that relate the content (defined by metadata attributes) between two or more nodes within a Web tuple. Link associations are rules that show the connectivity of different URLs. Distinguishing the two types of associations provides a view of the structure of the Web data. The goal of performing Web association mining on Web data is to better organize searching patterns through hyperlinked document

Cost-benefit Analysis of Web Bag in a Web Warehouse

Sets and bags are closely related structures and have been studied in relational databases. A bag is different from a set in that it is sensitive to the number of times an element occurs, while a set is not. In this paper, we introduce the concept of a Web bag in the context of a World Wide Web warehouse called WHOWEDA (WareHouse Of WEb DAta) which we are currently building. Informally, a Web bag is a Web table which allows multiple occurrences of identical Web types. A Web bag helps one to discover useful knowledge from a Web table, such as visible documents or Web sites (i.e. documents/sites which can be reached by many paths), luminous documents (i.e. documents with many outgoing links) and luminous paths (i.e. frequently traversed paths). In this paper, we provide a cost-benefit analysis of materializing Web bags as compared to Web tables with distinct Web tuple

Reducing Cognitive Overheads in a Web Warehouse using Reverse-Osmosis

This paper provides a quantitative analysis of reducing cognitive overheads in a Web warehouse using an important class of operation called reverse osmosis. The analysis is used to examine two different cognitive overheads of locating relevant nodes or information and display time of a Web table. A reverse-osmosis operation enables us to eliminate in relevant information from a collection of Web documents stored in the form of a Web table. We call such an operation reverse-osmosis because it is analogous to the reverse osmosis process in the field of water purification. We discuss a formal algorithm of the reverse-osmosis operatio

Pi-Web Join in a Web Warehouse

With the enormous amount of data stored in the World Wide Web, it is increasingly important to design and develop powerful web warehousing tools. The key objective of our web warehousing project, called WHOWEDA (Warehouse of Web Data), is to design and implement a web warehouse that materializes and manages useful information from the web. We introduce the concept of Π-web join in the context of WHOWEDA. Pi-web join operator is a web information manipulation operator to combine relevant web information residing in two web tables. Informally, it is the combination of web join and web project operators which filter out irrelevant information from a joined web table. We show how to construct the Π-joined web table and its schema. We also highlight the benefits of the Pi-web join operator