Proceedings of the Second International Conference on Web Information Systems Engineering

3-6 Dec. 2001

Go

Filter Results

Displaying Results 1 - 25 of 38
  • Proceedings of the Second International Conference on Web Information Systems Engineering

    Publication Year: 2001
    Request permission for commercial reuse | |PDF file iconPDF (408 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s): 359
    Request permission for commercial reuse | |PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • XForms in X-Smiles

    Publication Year: 2001, Page(s):203 - 211 vol.1
    Cited by:  Papers (3)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1278 KB) | HTML iconHTML

    World Wide Web Consortium is currently specifying XForms form language, which is intended to be the next generation language for Web forms. XForms is not currently supported by the major browsers, which prevents the early utilization of XForms. In this paper, we describe our implementation of XForms. The implementation is part of our X-Smiles browser, which is an open source XML browser. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Observing transaction-time semantics with TTXPath

    Publication Year: 2001, Page(s):193 - 202 vol.1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (942 KB) | HTML iconHTML

    Transaction time is the time of database transactions that create, modify, or destroy facts. It is used to record when facts exist in a database. Accounting for transaction time is essential to supporting audit queries that delve into past database states and differential queries that pinpoint differences between two states. In a web context, transaction time is a problematic concept because there... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using link types in Web page ranking and filtering

    Publication Year: 2001, Page(s):311 - 320 vol.1
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (958 KB) | HTML iconHTML

    Corresponding to the evolution of the Web from the poorly structured towards more structured, semantic rich network, search methods that apply to it are also evolving from using little structural and semantic information to using more such information that is available. This paper proposes a ranking and filtering mechanism that makes use of link types that is representable with new Web standards. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extension mechanism in extensible XML query language X2QL

    Publication Year: 2001, Page(s):183 - 192 vol.1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (898 KB) | HTML iconHTML

    XML has been used to code various types of data in a wide range of application domains, and the volume of XML data has been rapidly increasing. XML query languages provide a clue to manipulating huge amounts of XML data. XML data in each application domain have their own structures and associated semantics. Therefore, to appropriately process them, we sometimes need domain dependent functions, tak... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A meta-search method reinforced by cluster descriptors

    Publication Year: 2001, Page(s):125 - 132 vol.1
    Cited by:  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (763 KB) | HTML iconHTML

    A meta-search engine acts as an agent for the participant search engines. It receives queries from users and redirects them to one or more of the participant search engines for processing. A meta-search engine incorporating many participant search engines is better than a single global search engine in terms of the number of pages indexed and the freshness of the indexes. The meta-search engine st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and evaluation of an example-based graphical manipulation framework for XML

    Publication Year: 2001, Page(s):222 - 231 vol.1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (966 KB) | HTML iconHTML

    This paper explains a novel manipulation framework for XML. The key idea is to choose some example XML elements existing in the database and show the system how to manipulate them. The system then infers how to manipulate the whole collection of XML documents. The framework is unique in that while other approaches require users to write (or draw) explicit query specifications in their own query la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Support IR query refinement by partial keyword set

    Publication Year: 2001, Page(s):245 - 253 vol.1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (749 KB) | HTML iconHTML

    As our early work, we proposed a data mining model for query refinement using Association Rules (ARs) mined among keywords of a large document database. In this paper, first, we explicitly identify principles of a data mining model for query refinement, and show that our model satisfies the principles. Second, we propose a mechanism to reduce the large number of ARs using a concept called "prime k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of a PKI-based end-to-end secure infrastructure for mobile e-commerce

    Publication Year: 2001, Page(s):3 - 7 vol.1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (366 KB) | HTML iconHTML

    The popularity of handheld mobile devices and deployment of the public key infrastructure in many parts of the world have led to the development of electronic commerce on mobile devices. For the current version of mobile phones, the main challenge is the limited computing capacity on these devices for PKI-based end-to-end secure transactions. This paper presents a new architecture and protocol for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using online relevance feedback to build effective personalized metasearch engine

    Publication Year: 2001, Page(s):262 - 268 vol.1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (676 KB) | HTML iconHTML

    Metasearch Engine is popular for facilitating users' queries over multiple search engines and increasing the coverage of the WWW. How to rank the merged results becomes crucial for the success of metasearch engines. Many current metasearch engines have poor precision, for one or more of selected source search engine returns irrelevant results. On the other hand, users with different interests may ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integration of multiple dissemination-based information sources using source data arrival properties

    Publication Year: 2001, Page(s):21 - 30 vol.1
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (775 KB) | HTML iconHTML

    The integration of heterogeneous information sources is an important data engineering research issue. Various types of information sources are available today. They include dissemination-based information sources, which actively and autonomously deliver information from servers to users. We are developing a mediator/wrapper-based information integration system in which we employ ECA rules to defin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast online dynamic association rule mining

    Publication Year: 2001, Page(s):278 - 287 vol.1
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (938 KB) | HTML iconHTML

    At present, there are no association rule mining algorithms that are suitable for use in electronic commerce because they do not consider that new products are introduced and old ones are retired frequently and they assume that support thresholds do not change. In this paper a new algorithm called Fast Online Dynamic Association Rule Mining (FOLDARM) is introduced for mining in electronic commerce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to relate the Web communities through bipartite graphs

    Publication Year: 2001, Page(s):301 - 310 vol.1
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (941 KB) | HTML iconHTML

    The Web harbors a large number of community structures. Early detection of community structures has many purposes such as reliable searching and selective advertising. In this paper we investigate the problem of extracting and relating the web community structures from a large collection of Web-pages by performing hyper-link analysis. The proposed algorithm extracts the potential community signatu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing semistructured databases using ORA-SS model

    Publication Year: 2001, Page(s):171 - 180 vol.1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (875 KB) | HTML iconHTML

    Semistructured data has become prevalent with the growth of the Internet. The development of new web applications that require efficient design and maintenance of large amounts of data makes it increasingly important to design "good" semistructured databases to prevent data redundancy and updating anomalies. However, it is not easy, even impossible, for current semistructured data models to captur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • XML structures for relational data

    Publication Year: 2001, Page(s):151 - 160 vol.1
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (896 KB) | HTML iconHTML

    XML is increasingly being adopted for information publishing on the World Wide Web. However, the underlying data is often stored in the relational databases. Some mechanism is needed to convert the relational data into XML data. In this work we employ a semantically rich semistructured data model, the object-relationship-attribute model for semistructured data, as a middleware to support the schem... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Use link-based clustering to improve Web search results

    Publication Year: 2001, Page(s):115 - 124 vol.1
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (868 KB) | HTML iconHTML

    While Web search engines can retrieve information on the Web for a specific topic, users have to step a long ordered list in order to locate the needed information, which is often tedious and less efficient. We propose a new link-based clustering approach to cluster search results returned from Web search engines by exploring both co-citation and coupling. Unlike document clustering algorithms in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic XML construction in Natix

    Publication Year: 2001, Page(s):212 - 221 vol.1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (870 KB) | HTML iconHTML

    While using an algebra that acts on sets of variable bindings for evaluating XML queries, the problem of constructing XML from these bindings arises. One approach is to define a powerful operator that is able to perform a complex construction of a representation of the XML result document. The drawback is that such an operator in its generality is hard to implement and disables algebraic optimizat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cognitive study of information seeking processes in the WWW: the effects of searcher's knowledge and experience

    Publication Year: 2001, Page(s):321 - 327 vol.1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (644 KB) | HTML iconHTML

    We investigated, through a cognitive psychological experiment and its protocol analysis, human cognitive processes of seeking information on the WWW and the effects of a subject's knowledge and experience on the information seeking processes and performance. In our experiment, the subjects were divided into two groups: one comprising expert subjects and the other novice subjects. All subjects were... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A probabilistic approach for discovering authoritative Web pages

    Publication Year: 2001
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (796 KB) | HTML iconHTML

    The World Wide Web (WWW) is becoming the most important system for delivering information. Search services on the WWW are becoming increasing popular among users because of the huge amount of data available and consequently it is difficult to retrieve and filter it. Several works have argued that traditional term-based search engines are not very useful since the resulting ranking depends on the p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Storing and querying multiversion XML documents using durable node numbers

    Publication Year: 2001, Page(s):232 - 241 vol.1
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (990 KB) | HTML iconHTML

    Managing multiple versions of XML documents represents an important problem for many traditional applications, such as software configuration control, as well as new ones, such as link permanence of web documents. Research on managing multiversion XML documents seeks to provide efficient and robust techniques for storing, retrieving and querying such documents. In this paper we present a novel app... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rough set-based hybrid method to text categorization

    Publication Year: 2001, Page(s):254 - 261 vol.1
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (825 KB) | HTML iconHTML

    In this paper we present a hybrid text categorization method based on Rough Sets theory. A central problem in good text classification for information filtering and retrieval (IF/IR) is the high dimensionality of the data. It may contain many unnecessary and irrelevant features. To cope with this problem, we propose a hybrid technique using Latent Semantic Indexing (LSI) and Rough Sets theory (RS)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic models for knowledge management

    Publication Year: 2001, Page(s):8 - 16 vol.1
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (775 KB) | HTML iconHTML

    We explore the use of a semantic model to support a group of strategic business analysts in their daily work. In particular, we present a set of modeling constructs for representing goals, events and actors that are relevant to the work of analysts. We also describe a qualitative goal analysis procedure which makes it possible to reason about a goal model under different assumptions. The paper als... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MOT: memory online tracing of Web information system

    Publication Year: 2001, Page(s):271 - 277 vol.1
    Cited by:  Patents (30)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (601 KB) | HTML iconHTML

    With advances in World-Wide Web applications and technologies, research on measurement and modeling of Internet and Web-based information systems has become increasingly important This paper focuses on continuously monitoring Web traffic by packet sniffing on high-speed links, which is the foundation of analyzing theoretical models of Web characteristics and evolvement. The author presents MOT, a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mediators over ontology-based information sources

    Publication Year: 2001, Page(s):31 - 40 vol.1
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (963 KB) | HTML iconHTML

    We propose a model for providing integrated and unified access to multiple information sources of the kind of Web catalogs. We assume that each source comprises two parts: (a) an ontology i.e. a set of terms structured by a subsumption relation, and (b) a database that stores objects of interest under the terms of the ontology. We assume that these objects belong to an underlying domain that is co... View full abstract»

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