By Topic

Database Systems for Advanced Applications, 2001. Proceedings. Seventh International Conference on

Date 18-21 April 2001

Filter Results

Displaying Results 1 - 25 of 54
  • Proceedings Seventh International Conference on Database Systems for Advanced Applications. DASFAA 2001

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (231 KB)
    Freely Available from IEEE
  • A rule-based query language for HTML

    Publication Year: 2001, Page(s):6 - 13
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (639 KB) | HTML iconHTML

    With the recent popularity of the Web, an enormous amount of information is now available online. Most Web documents available over the Web are in HTML format and are hierarchically structured in nature. How to query such Web documents based on their internal hierarchical structure becomes more and more important. We present a rule-based language called WebQL to support effective and flexible Web ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling and manipulating multidimensional data in semistructured databases

    Publication Year: 2001, Page(s):14 - 21
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (753 KB) | HTML iconHTML

    Multidimensional information is pervasive in many computer applications including time series, spatial information, data warehousing, and visual data. While semistructured data or XML is becoming more and more popular for information integration and exchange, not much research work has been done in the design and implementation of semistructured database systems to manage multidimensional informat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new query processing technique for XML based on signature

    Publication Year: 2001, Page(s):22 - 29
    Cited by:  Papers (4)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB) | HTML iconHTML

    XML is represented as a tree and the query as a regular path expression. The query is evaluated by traversing each node of the tree. Several indexes are proposed for regular path expressions. In same cases these indexes may not cover all possible paths because of storage requirements. We propose a signature-based query optimization technique to minimize the number of nodes retrieved from the datab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • '1+1>2': merging distance and density based clustering

    Publication Year: 2001, Page(s):32 - 39
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (762 KB) | HTML iconHTML

    Clustering is an important data exploration task. Its use in data mining is growing very fast. Traditional clustering algorithms which no longer cater for the data mining requirements are modified increasingly. Clustering algorithms are numerous which can be divided in several categories. Two prominent categories are distance-based and density-based (e.g. K-means and DBSCAN, respectively). While K... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A similarity-based soft clustering algorithm for documents

    Publication Year: 2001, Page(s):40 - 47
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (898 KB) | HTML iconHTML

    Document clustering is an important tool for applications such as Web search engines. Clustering documents enables the user to have a good overall view of the information contained in the documents that he has. However, existing algorithms suffer from various aspects, hard clustering algorithms (where each document belongs to exactly one cluster) cannot detect the multiple themes of a document, wh... View full abstract»

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

    Publication Year: 2001, Page(s):48 - 55
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (703 KB) | HTML iconHTML

    Clustering is one of the important techniques in data mining. The objective of clustering is to group objects into clusters such that objects within a cluster are more similar to each other than objects in different clusters. The similarity between two objects is defined by a distance function, e.g., the Euclidean distance, which satisfies the triangular inequality. Distance calculation is computa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A binary-categorization approach for classifying multiple-record Web documents using application ontologies and a probabilistic model

    Publication Year: 2001, Page(s):58 - 65
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (722 KB) | HTML iconHTML

    The amount of information available on the World Wide Web has been increasing dramatically in recent years. To enhance speedy searching and retrieving Web documents of interest, researchers and practitioners have partially relied on various information retrieval techniques. We propose a probabilistic model to classify Web documents into relevant documents and irrelevant documents with respect to a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SOM-based methodology for building large text archives

    Publication Year: 2001, Page(s):66 - 73
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (722 KB) | HTML iconHTML

    Not only have self-organizing maps (SOMs), such as the WEBSOM, been shown to scale up to very large datasets, these maps also allow for a novel mode of navigating through a large collection of text documents. The entire text collection is presented to a user as a regular map, where each point in the map is associated to a group of documents that are likely to be composed of similar terms and phras... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Page Cube: a model for storage and retrieval of documents relevant to a document production workflow in an office

    Publication Year: 2001, Page(s):74 - 81
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (738 KB) | HTML iconHTML

    A model for storage and retrieval of relevant documents during a document production workflow in an office is presented. The objective of the workflow is to review a document by multiple reviewers, where each reviewer contributes her own comments during review based on other documents containing standing rules, precedents etc, which is termed, the context. Storage of such documents is modeled as a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An empirical study on the visual cluster validation method with Fastmap

    Publication Year: 2001, Page(s):84 - 91
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (677 KB) | HTML iconHTML

    This paper presents an empirical study on the visual method for cluster validation based on the Fastmap projection. The visual cluster validation method attempts to tackle two clustering problems in data mining: to verify partitions of data created by a clustering algorithm; and to identify genuine clusters from data partitions. They are achieved through projecting objects and clusters by Fastmap ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distance courseware discrimination based on representative sentence assaying

    Publication Year: 2001, Page(s):92 - 99
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (599 KB) | HTML iconHTML

    In order to train distance learning students the discernment ability, teachers often suggest Web courseware on specific topics, such as controversial social issues, with different viewpoints. Traditional discriminating strategies based on simple keyword matching often lead to low accuracy of discrimination. This paper proposes a method called DRSA (discriminating via representative sentence assayi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Encapsulating classification in an OODBMS for data mining applications

    Publication Year: 2001, Page(s):100 - 106
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (651 KB) | HTML iconHTML

    Classification is an important task in data mining. Encapsulating classification in an object-oriented database system requires additional features: we propose multiobjects and schema evolution. Our approach allows us to store classification functions, and to store instances of each group in order to retrieve them later. Since the database is operational, it allows us also to perform dynamic class... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Introducing cooperation and actions in amalgamated knowledge bases

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

    The theory of amalgamated knowledge bases represents a formal logical foundation for heterogeneous databases. In an amalgamated knowledge base, data sources are modeled by generalized annotated logic. Moreover, an amalgamated knowledge base is equipped with a supervisor acting as a mediator for amalgamating knowledge from the local databases. Even if the framework is quite appealing, it does not m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A logical foundation for deductive object-oriented databases

    Publication Year: 2001, Page(s):116 - 123
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (761 KB) | HTML iconHTML

    Over the past decade, a large number of deductive object-oriented database languages have been proposed. The earliest of these languages had few object-oriented features, and more and more features have systematically been incorporated in successive languages. However, a language with a clean logical semantics that naturally accounts for all the key object-oriented features, is still missing from ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-cube computation

    Publication Year: 2001, Page(s):126 - 133
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (750 KB) | HTML iconHTML

    Computing an n-attribute datacube requires the computation of an aggregate function over all groups generated by 2/sup n/ interrelated GROUP-BYs. In this paper, we focus on multi-cube computation. We extend the algorithms for single datacube computation to process multiple datacubes simultaneously. The issue we intend to explore is the memory utilization. We propose two multi-cube algorithms, name... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ADODA: a desktop online data analyzer

    Publication Year: 2001, Page(s):134 - 141
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (819 KB) | HTML iconHTML

    This paper considers the design, implementation, and performance of ADODA with emphasis on aggregate computation. ADODA is a MOLAP data engine for OLAP applications. As embedded software, it features a compact and portable design. A multi-tier structure is devised to store the aggregates and primary data in one single data structure, so that they are accessed in the same way, and they are indistin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A process of abstracting T-RBAC aspects from enterprise environment

    Publication Year: 2001, Page(s):144 - 145
    Cited by:  Papers (1)
    Request permission for commercial reuse | PDF file iconPDF (146 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analyzing the critical path for the well-formed workflow schema

    Publication Year: 2001, Page(s):146 - 147
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (227 KB) | HTML iconHTML

    Though the concept of critical path in the workflow is important because it can be utilzied in many issues in workflow systems, the critical path in the context of the workflow has not been much addressed in the past. In this paper we propose a method to systematically determine the critical path in a workflow schema built by the workflow control constructs described in our workflow model. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Facilitating workflow evolution in an advanced object environment

    Publication Year: 2001, Page(s):148 - 149
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (83 KB) | HTML iconHTML

    Workflow is automation of a business process. A Workflow Management Systems (WFMS) is a system that assists in defining, managing and executing workflows. To support flexible enactment and adapive features, such as on-line workflow evolutionand exception handling, a WFMS requires advanced modeling functionality. As workflow evolution requires the modification of workflow definitions or adding ECA ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conceptual graphs as schemas for semi-structured databases

    Publication Year: 2001, Page(s):150 - 151
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (66 KB) | HTML iconHTML

    As the World Wide Web grows dramatically in recent years, there is increasing interest in semi-structured data on the web. Semi-structured data are usually represented in graph format, many graph schemas have then been proposed to extract schemas from those data graphs. Conceptual graphs, which use incremental conceptual clustering method to extract schemas, have initially been proposed in 2000. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the fairness of timely refresh of web views

    Publication Year: 2001, Page(s):152 - 153
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (102 KB) | HTML iconHTML

    The popularity of WWW has made it a prime vehicle for disseminating information. Compared to pure static and dynamic Web pages which are dynamically created by a CGI script at run-time, we focus on semi-dynamic Web pages whose contents are extracted from source databases and they change in response to updates to the source databases. An example of such a page can be found at http://www.fish.com.sg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining small databases by collecting knowledge

    Publication Year: 2001, Page(s):154 - 155
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (158 KB) | HTML iconHTML

    Current data mining techniques may not be helpful for mining some companies/organizations such as nuclear power plants and earthquake bureaus, which have only small databases. Apparently, these companies/organizations also expect to apply data mining techniques to extract useful patterns in their databases so as to make their decisions. However, data in these databases such as the accident databas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fractionalized view materialization in data cubes

    Publication Year: 2001, Page(s):156 - 157
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (141 KB) | HTML iconHTML

    In this paper, we introduce the concept of the 'fractionalized view'. The fractionalized view is the result of a query defined through aggregate functions and the range on each dimension, where the subdivision of each dimension is based on queries' access patterns. For the representation and selection of fractionalized views to materialize, we define the 'AND-OR cube graph'. With this structure, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Predicate-based caching in mobile clients for con tinuous partial match queries

    Publication Year: 2001, Page(s):158 - 159
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (150 KB) | HTML iconHTML

    This paper proposes a cache management scheme for continuous partial match queries in mobile computing systems. Conventional cache management methods for mobile clients are record ID-based ones. However, since the partial match query is a content-based retrieval, the conventional record ID-based approach cannot properly manage the cache consistency. We show the pr edicate- based approach is an eff... View full abstract»

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