Skip to main content

and
  1. No Access

    Chapter

    Improved Parallel Algorithms for Path Expression Query Processing of Semi-Structured Data

    Semi-structured data can be described by a labelled directed graph. The costs of processing path expression based queries on semi-structured data could be very high due to conventional graph traversals may be ...

    Wenjun Sun, Kevin J. Lü, Kam Fai Wong in Cooperative Internet Computing (2003)

  2. No Access

    Chapter and Conference Paper

    A New Conceptual Graph Generated Algorithm for Semi-structured Databases

    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 ...

    Kam Fai Wong, Yat Fan Su, Dongqing Yang in Web Intelligence: Research and Development (2001)

  3. No Access

    Chapter and Conference Paper

    Approximate Graph Schema Extraction for Semi-structured Data

    Semi-structured data are typically represented in the form of labeled directed graphs. They are self-describing and schemaless. The lack of a schema renders query processing over semi-structured data expensive...

    Qiu Yue Wang, Jeffrey Xu Yu, Kam-Fai Wong in Advances in Database Technology — EDBT 2000 (2000)