Catálogo de publicaciones - libros

These proceedings contain the papers selected for presentation at the third edition of the International Workshop on Conceptual Modeling in GIS, CoMoGIS 2006, held in November 2006, in Tucson, Arizona, USA, in conjunction with the annual International Conference on Conceptual Modeling (ER 2006). Following the success of CoMoGIS 2005 (held in Klagenfurt, Austria) and CoMoGIS 2004 (held in Shanghai, China), its aim was to bring together researchers investigating issues related to conceptual modeling for geographic and spatial information handling systems, and to encourage interdisciplinary discussions including the identification of emerging and future issues. The call for papers attracted 19 papers, many of them of excellent quality and most of them very related to the topics of the workshop. Each paper received three reviews. Based on these reviews, eight papers were selected for presentation and inclusion in the proceedings. The accepted papers cover a wide range of topics from spatial and spatio-temporal data representation, to indexing methods for moving objects, to optimization of spatial queries and to spatio-temporal data on the Web. Our keynote presentation, given by Peter Baumann, discussed large-scale raster services.

The problem of access control in databases consists of determining when (and if) users or applications can access stored data, and what kind of access they are allowed. This paper discusses this problem for geographic databases, where constraints imposed on access control management must consider the spatial location context. The model and solution provided are motivated by problems found in AM/FM applications developed in the management of telephone infrastructure in Brazil, in a real life situation.

Moving object databases are required to support queries on a large number of continuous moving objects. Indexes for moving objects must support both query and update operations efficiently. In previous work TPR-tree is the most popular indexing method for the future predicted position, but its frequent updates performance is very poor. In this paper we propose a novel indexing method, called VTPR-tree, for predicted trajectory of moving objects. VTPR-tree takes into account both the velocity and space distribution of moving objects. First the velocity domain is split, and moving objects are classified into different velocity buckets by their velocities, thus objects in one bucket have similar velocities. Then we use an improved TPR-tree structure to index objects in each bucket. VTPR-tree is supplemented by a hash index on IDs of moving objects to support frequent updates. Also an extended bottom-up update algorithm is developed for VTPR-tree, thus having a good dynamic update performance and concurrency. Experimental results show that the update and query performance of VTPR-tree outperforms the TPR*-tree.

The Internet has created an interesting environment for geospatial data sharing, so that users may transfer, visualize, manipulate and interact the data sets. This environment not only provides new opportunities to geospatial data usage, but also introduces new problems that should be addressed in order to provide an efficient and effective use of these datasets. One of such problems is related to the use of these spatial datasets in a low-bandwidth environment, such as those involving mobile computing. This paper presents a progressive transmission method for vector maps on the Web. The proposed method anticipates the map rasterization process to be performed at the server side, so that the amount of information transmitted may be reduced. We combine scale-dependent transmission techniques with simplification and progressive ones, in order to maximize the overall performance of a Web GIS environment.

Web Service (WS) developers must take several decisions to design Service Oriented Architectures. Some of these decisions are: which operations should provide the involved Web Service, how we can detect these operations, in which way this can be automated and which is the right granularity of the operations. To address some of these questions, we present in this paper a methodological approach that extends the OOWS web engineering method. Following a model-driven approach, we systematically identify and design the operations of a Web service, taking as the source: (1) the tasks that the user must be able to achieve and (2) the OOWS conceptual models.

Three themes are apparent in recent schema integration, evolution and versioning research. First, the need to reduce the number of schema changes that are necessary. The approach here has been to build into the conceptual and data models the scope to accommodate modest changes to definition. Second, research that aims to reuse the current schema definition through procedures that mask the changes through sophisticated wrappers or techniques for multiple extensional data. Finally, techniques that enable schema change to be accommodated as seamlessly and as painlessly as possible. All these approaches have their limitations and strengths. This paper investigates each of these approaches and outlines the current research directions in schema integration, evolution and versioning.

We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of change detection in temporal data warehouses and inspired by a well known tree comparison algorithm, we developed a heuristic method to calculate an edit script transforming an old version of a graph to the new one. This edit script is composed of operations for inserting and deleting nodes and changing labels and values of nodes as well as for inserting and deleting edges to cover rearrangements of nodes (moves). We present the prerequisites of our approach, the different phases of the algorithm and discuss some evaluation results gained from a prototypic implementation. Our approach is applicable to arbitrary labeled DAGs in any context, but optimized for rooted, ordered and labeled acyclic digraphs with a small rate of changes between the DAGs to be compared.

An issue in utilizing ontology in product information domain is how to make it operational. This requires considering the features to be included in a pragmatic product information database which should contain the key concepts and the relationships in the domain. Ontological modeling of product information is a starting as well as a most important point for practical deployment. It often involves problems such as the choice and representation of the proper semantic relationships, handling of product properties, and product descriptions associated with their units of measure. In this paper, we introduce an approach to those problems. We recently engaged in a project to build an operational product ontology system. The directions to problems, which are presented in this paper, were obtained from this project, and may serve a role as a reference model for similar projects in future.

These proceedings contain the papers of the second edition of the QoIS workshop held in conjunction with the 25th International Conference on Conceptual Modeling (ER2006).

This paper is an introduction to the 2nd International Workshop on Quality of Information Systems. It introduces the 6 papers accepted to the workshop via a well-known model of information system success.