Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Franky Lam

dblp:48/1018 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
0since 2021 · last 2007
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 8 · 3 first-authorArtificial intelligence and machine learning · 3 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 50% Graph data management · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph data management › graph query
navigational query
0.112007
Querying and maintaining a compact XML storage · WWW 2007
Indexing and storage engines
XML storage
0.112007
Querying and maintaining a compact XML storage · WWW 2007

Methods — techniques the papers use, named apart from their topics

information-theoretic space analysis · 0.1
YearPublicationVenuePosition
2007 Querying and maintaining a compact XML storage
abstract
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents a new storage scheme for XML data that supports all navigational operations in near constant time. In addition to supporting efficient queries, the space requirement of the proposed scheme is within a constant factor of the information theoretic minimum, while insertions and deletions can be performed in near constant time as well. As a result, the proposed structure features a small memory footprint that increases cache locality, whilst still supporting standard APIs, such as DOM, and necessary database operations, such as queries and updates, efficiently. Analysis and experiments show that the proposed structure is space and time efficient.
Raymond K. Wong 0001, Franky Lam, William M. Shui
WWW2
2004 Algebraic Transformation and Optimization for XQuery
Damien K. Fisher, Franky Lam, Raymond K. Wong 0001
APWeb2
2004 Skipping Strategies for Efficient Structural Joins
Franky Lam, William M. Shui, Damien K. Fisher, Raymond K. Wong 0001
DASFAA1
2004 Effective Clustering Schemes for XML Databases
William M. Shui, Damien K. Fisher, Franky Lam, Raymond K. Wong 0001
DEXA3
2003 An Efficient Path Index for Querying Semi-structured Data
Michael Barg, Raymond K. Wong 0001, Franky Lam
APWeb3
2003 Efficient ordering for XML data
abstract
With the increasing popularity of XML, there arises the need for managing and querying information in this form. Several query languages, such as XQuery, have been proposed which return their results in document order. However, most recent efforts focused on query optimization have disregarded order. This paper presents a simple yet elegant method to maintain document ordering for XML data. Analysis of our method shows that it is indeed efficient and scalable, even for changing data.
Damien K. Fisher, Franky Lam, William M. Shui, Raymond K. Wong 0001
CIKM2
2002 Efficient synchronization for mobile XML data
abstract
Many handheld applications receive data from a primary database server and operate in an intermittently connected environment these days. They maintain data consistency with data sources through sychronization. In certain applications such as sales force automation, it is highly desirable if updates on the data source can be reflected at the handheld applications immediately. This paper proposes an efficient method to synchronize XML data on multiple mobile devices. Each device retrieves and caches a local copy of data from the database source based on a regular path expression. These local copies may be overlapping or disjoint with each other. An efficient mechanism is proposed to find all the disjoint copies to avoid unnecessary synchronizations. Each update to the data source will then be checked to identify all handheld applications which are affected by the update. Communication costs can be further reduced by eliminating the forwarding of unnecessary operations to groups of mobile clients.
Franky Lam, Nicole Lam, Raymond K. Wong 0001
CIKM1
2001 Modeling and Manipulating Multidimensional Data in Semistructured Databases
abstract
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 information efficiently. In this paper, dimension operators have been defined based on a multidimensional logic which we call ML(/spl omega/). It can be used in applications such as multidimensional spreadsheets and multidimensional databases usually found in decision support systems and data warehouses. Finally a multidimensional, an XML database system is prototyped and described in detail. Technologies such as XSL are used to transform or visualise data from different dimensions.
Franky Lam, Raymond K. Wong 0001, Mehmet A. Orgun
DASFAA1
2001 Modelling and Manipulating Multidimensional Data in Semistructured Databases
Raymond K. Wong 0001, Franky Lam, Mehmet A. Orgun
World Wide Web2
2000 An XML Repository for Molecular Sequence Data
abstract
The emergence of the Extensible Markup Language (XML) as a new standard for data representation and exchange on the World Wide Web has created a new information revolution. Several proposals have been made to formulate molecular sequences in XML, however none of them mentioned the efficient storage and management of the resultant XML sequence data. This paper addresses some implementation issues of an XML repository for molecular sequence data.
Raymond K. Wong 0001, Franky Lam, Stephen C. Graham, William M. Shui
BIBE2