Results 1 -
3 of
3
A methodology for clustering XML documents by structure
- Information Systems
, 2006
"... The processing and management of XML data are popular research issues. However, operations based on the structure of XML data have not received strong attention. These operations involve, among others, the grouping of structurally similar XML documents. Such grouping results from the application of ..."
Abstract
-
Cited by 50 (0 self)
- Add to MetaCart
(Show Context)
The processing and management of XML data are popular research issues. However, operations based on the structure of XML data have not received strong attention. These operations involve, among others, the grouping of structurally similar XML documents. Such grouping results from the application of clustering methods with distances that estimate the similarity between tree structures. This paper presents a framework for clustering XML documents by structure. Modeling the XML documents as rooted ordered labeled trees, we study the usage of structural distance metrics in hierarchical clustering algorithms to detect groups of structurally similar XML documents. We suggest the usage of structural summaries for trees to improve the performance of the distance calculation and at the same time to maintain or even improve its quality. Our approach is tested using a prototype testbed.
A High Performance System for Viewing, Querying, and Retrieval of Geospatial Data Distributed Across a Beowulf Cluster
"... Abstract. The size of many geospatial databases has grown exponentially in recent years. This increase in size brings with it an increased requirement for additional CPU and I/O resources to handle the querying and retrieval of this data. A number of proprietary systems could be ideally suited for s ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. The size of many geospatial databases has grown exponentially in recent years. This increase in size brings with it an increased requirement for additional CPU and I/O resources to handle the querying and retrieval of this data. A number of proprietary systems could be ideally suited for such tasks, but are impractical in many situations because of their high cost. On the other hand, Beowulf clusters have gained popularity for providing such resources in a costeffective manner. In this paper, we present a system that uses the compute nodes of a Beowulf cluster to store fragments of a large geospatial database and allows for the seamless viewing, querying, and retrieval of desired geospatial data in a parallel fashion i.e. utilizing the compute and I/O resources of multiple nodes in the cluster. Experimental results are provided to quantify the performance of the system and ascertain its feasibility versus traditional GIS architectures.
Integrating Web Services into Map Image Applications
"... Web services have been opening a wide avenue for software integration. In this paper, we have reported our experiments with three applications that are built by utilizing and providing web services for Geographic Information Systems (GIS). The services are designed to handle a large number of concur ..."
Abstract
- Add to MetaCart
(Show Context)
Web services have been opening a wide avenue for software integration. In this paper, we have reported our experiments with three applications that are built by utilizing and providing web services for Geographic Information Systems (GIS). The services are designed to handle a large number of concurrent requests. It is clear that performance has to be the central consideration in design of GIS web services. The lessons learned from these experiments include the application of the rich metadata message approach, choosing large size of unstructured data but limiting the structured message’s sizes, and minimizing COTS software customization. 1.
