By Topic

Database Applications in Non-Traditional Environments, 1999. (DANTE '99) Proceedings. 1999 International Symposium on

Date 28-30 Nov. 1999

Filter Results

Displaying Results 1 - 25 of 62
  • Proceedings 1999 International Symposium on Database Applications in Non-Traditional Environments (DANTE'99) (Cat. No.PR00496)

    Publication Year: 1999
    Save to Project icon | Request Permissions | PDF file iconPDF (257 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 1999 , Page(s): 481 - 482
    Save to Project icon | Request Permissions | PDF file iconPDF (91 KB)  
    Freely Available from IEEE
  • Image classification and retrieval based on wavelet-SOM

    Publication Year: 1999 , Page(s): 164 - 167
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (180 KB)  

    The paper describes a new method to extract and cluster image features for effective still image databases. The feature vectors concerning color and texture are extracted using the multiresolution wavelet. In contrast to traditional image databases where feature vectors extracted from stored images are stored and used to match the feature vector of the input image for similarity retrieval, we use the self-organizing map neural network for clustering stored images. No feature vectors are stored in the databases, which saves storage space. A prototype image database is developed and some experiments are performed using it. The paper reports on the architecture and experimental results View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual human life simulation and database: why and how

    Publication Year: 1999 , Page(s): 471 - 479
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (408 KB)  

    In combination with the rapid technical improvements of computers, building large virtual scenes has become a popular field in computer graphics. Often, within a real reconstructed city, a building that has disappeared, or a virtual town, virtual humans populating these scenes are expected to provide a feeling of real life. Our specific aim is to populate these scenes with virtual humans in order to offer assistance in decision making concerning urban infrastructures. In this view, we have to integrate the problem of planning human actions and behaviour for urban life simulation into a virtual town. We present an informed environment, which corresponds to a database dedicated to urban life simulation. We discuss the use of a database, and methods and tools for creating and providing the information necessary for animating virtual humans in a city. The informed environment is based on the hierarchical decomposition of an urban scene into environment entities providing geometrical information as well as semantic notions, thus allowing a more realistic simulation of humans. In this manner, virtual humans can be provided with a certain kind of urban knowledge. Moreover, the database can offer other types of services for scene creation for example View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and performance evaluation of parallel algorithms for path expressions in object database systems on NOW

    Publication Year: 1999 , Page(s): 395 - 402
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (316 KB)  

    In OODB, path expressions are usually used for navigating through complex objects and obtaining necessary information at the far end of a sequence of object references. The parallel forward pointer chasing algorithm (PFPC) and parallel backward pointer algorithm (PBPC) are natural algorithms for path expressions. If we change the implicit joins in the path expression into explicit joins, parallel join algorithms can also be employed for path expressions. In order to improve performance in a distributed environment, semi-join operations replace the join operations, which is called the parallel cascade semi-join algorithm (PCSJ). This paper mainly describes and compares PFPC and PCSJ algorithms implemented on DSVM; then analyzes the performance of algorithms from test results according to a certain benchmark. We can see PCSJ has much better performance than PFPC by the results. These parallel algorithms exploit pipelining and I/O communication parallelism; making full use of DSVM characteristics. Some valuable ideas are obtained from the theory analysis and practical testing View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative database system: a constructive review of cooperative transaction models

    Publication Year: 1999 , Page(s): 315 - 324
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (456 KB)  

    The use of transactions to provide reliable and secure information processing and data management has increasingly gained the attention of the CSCW community. Traditional transaction models have, however been claimed to be too restrictive in the context of cooperation. Research on transaction support for cooperative work has therefore particularly aimed at finding mechanisms and frameworks to overcome this limitation. In this paper we survey the work done in the development of flexible and cooperative transaction models. This survey has been divided into two categories. The first consists of approaches mainly based on the CSCW perspective, while the second category consists of database methods extended to support cooperation. The paper also provides an evaluation of the models with respect to relevant criteria and requirements for cooperative work settings View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MurMur: a research agenda on multiple representations

    Publication Year: 1999 , Page(s): 373 - 384
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (508 KB)  

    One of the most publicized goals of modern computer society is to provide flexible access to information for everybody, anywhere, anytime. To make data management systems successful in satisfying a user's quest for information, an absolute requirement is the capability of tailoring the information to the peculiar needs of the targeted user. Unfortunately, this is a domain where current technology fails to support adequate functionality. Basically, existing approaches to such versatility rely on the idea that all possible views of a piece of information can be derived from a single ultimate representation. This may work in a centralized setting, but it is definitely unlikely to provide a sufficient framework in distributed, interoperable environments. This paper presents a research and development project that intends to explore the issues related to representation and management of multiple representations of the same reality. A specific focus of the project is spatio-temporal information and the support of multi-scale geographic databases, where objects are represented at many different resolution levels View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heijo-a video database system for retrieving semantically coherent video information

    Publication Year: 1999 , Page(s): 176 - 179
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (164 KB)  

    This paper describes some time interval operations and their application, in conjunction with the research and development project for a video database system Heijo. Retrieving meaningful video fragments from video databases is a challenging issue. Heijo can process such queries by combining simple indices constructed on each video data. To this end, three kinds of operations on time intervals, namely intersection, union, and join operations are proposed. In addition, five kinds of time axes and categorization of video data based on the time axes are introduced so that we can distinguish video data by their contents View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Navigation of the Internet with spatial databases

    Publication Year: 1999 , Page(s): 121 - 124
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (236 KB)  

    Most Internet search engines are keyword based. They are not efficient for the queries where geographical location is important, such as finding hotels close to a place of interest. A natural interface for spatial searching is a map, which can be used not only to display locations of search results but also to assist forming search conditions. A map-based search engine requires a well-designed visual interface that is intuitive to use yet flexible and expressive enough to support various types of spatial queries as well as aspatial queries. Similar to hyperlinks for text and images in an HTML page, spatial objects in a map should support hyperlinks. Such an interface needs to be scalable with the size of the geographical regions and the number of Web sites it covers. In spite of handling typically a very large amount of spatial data, a map-based search interface should meet the expectation of fast response time for interactive applications. We discuss general requirements and the design for a new map-based Web search interface, and present a prototype View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximation method for extracting typical classes from semistructured data

    Publication Year: 1999 , Page(s): 197 - 200
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (176 KB)  

    We consider a class extraction problem over semistructured data. A class C is extracted by grouping objects having similar (not necessarily identical) sets of properties into C, where the set of properties of C is the union of those of the objects in C. Let C be an extracted class and o be an object in C. If C has property P but o has no property P value, then P is null within o. An extracted class c is called typical if the number of nulls in C is small against the number of object in C and the number of properties of C. We present the following results. First, we prove that the problem of deciding if a typical class can be extracted from given semistructured data is NP-complete. Second, we present an approximation algorithm for extracting typical classes from given semistructured data. Finally, we briefly discuss a sufficient condition for the approximation algorithm to run efficiently View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Querying structured documents based on human visual memory

    Publication Year: 1999 , Page(s): 267 - 270
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (160 KB)  

    Current information retrieval (IR) is mainly focused on retrieving documents that have not been read before, and to our knowledge, no research has been conducted for querying against already read documents. For such documents, querying based on visual memory is often helpful. In this paper, a framework for querying structured documents by making use of human visual memory is proposed, and an index structure suitable for such a framework is presented. Specifically, we discuss our proposal in the context of personalization, where a vast amount of primary source documents are reconstructed for end-users reflecting their preferences. We also mention some clues to implement our framework as well as future directions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward a 3D moving object data model-a preliminary consideration

    Publication Year: 1999 , Page(s): 302 - 312
    Cited by:  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (468 KB)  

    This paper investigates a new data model for the realization of a three-dimensional (3D) moving object database system. In contrast to the traditional approach, it can deal with spatio-temporal characteristics of moving objects in 3D space. A spatio-temporal sampling theory is introduced that enables a database system to store and manipulate all of the necessary spatio-temporal information about moving objects. The 3D moving object database consists of three kinds of relations: a set of primary relations, such as POSI, ORI, GRAD, and SHAPE, store all the essential spatio-temporal features of a single moving object; a set of built-in derived relations, such as DIR, SPEED, TRACK, DIST, MDIR, and TOPOL, store, for example, the motion direction of a single object (DIR) and the topological relation between two objects (TOPOL); and a set of user-defined relations such as BACK and FRONT with which one can issue a variety of spatio-temporal queries on moving objects. A domain relational calculus-based moving object query language named MOQL is shown View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of virtual workspaces

    Publication Year: 1999 , Page(s): 325 - 332
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (488 KB)  

    While traditional workflow management systems have proven useful in supporting well-defined organizational processes, they are less suitable for the support of less well-defined emergent processes. These kinds of processes are better supported by systems which are based on the notion of workspaces. The research prototype LiveNet, which allows workspaces to be defined and supports their dynamic modification and evolution, has been developed and successfully applied in a number of domains. Based on the experiences with LiveNet, current research is focused on analyzing the structures supporting cooperation defined by workspace system users. Such an analysis can reveal structural deficiencies which can be brought to the users' attention. It can also aid the accumulation of a library of successful structures for later reuse. Finally, it can aid in extracting personal styles or preferences from observed structures which can be applied in creating new ones View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New techniques for the discovery of logical documents in Web

    Publication Year: 1999 , Page(s): 125 - 132
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (352 KB)  

    We propose a method of identifying logical documents in Web data. Pages in Web data are sometimes designed for presentation and do not always reflect logical structure, while a logical document is a data unit representing logical structure. One logical document often corresponds to a connected subgraph consisting of multiple pages. Therefore, for various Web data processing that should capture logical structure, such as querying facilities, extended support for user navigation, and Web structure analysis, logical documents are more appropriate data units than pages. We develop a method of identifying such logical documents in existing Web data. Our method uses three kinds of information: link structure, directory structure embedded in URIs, and page contents View full abstract»

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

    Publication Year: 1999 , Page(s): 261 - 266
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (176 KB)  

    We deal with information system design when several responsibilities share a common subset of information. First, we show how to define information overlap situations between these responsibilities. Then we focus on these situations in order to understand how the responsibility areas can avoid information co-ordination misunderstandings. The study of these situations shows how to define the information-sharing protocols between these responsibility areas. From the methodological standpoint, the overlap situation analyses shed a new light on the understanding of coordination problems in the distributed IS domain View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A spatial database as a component of integrated database system

    Publication Year: 1999 , Page(s): 203 - 212
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (328 KB)  

    Huge amounts of spatial data have been accumulated by government agencies and other organizations for various kinds of applications, such as land information management, asset and facility management, resource management, and environment management. These data are typically collected, stored and used by different custodians for very specific purposes. The full benefits of using spatial data can be achieved by combining the data from different sources covering a common region. It is, however, a great challenge to use the spatial data collected and organized for one purpose for other purposes. In comparison with integration of traditional relational databases, there are a number of unique problems faced by spatial database integration, such as data resolution and precision, data models and representation, and spatial indexes. We identify these issues and discuss possible solutions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable DBMS for large scientific simulations

    Publication Year: 1999 , Page(s): 271 - 275
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (228 KB)  

    Scientific simulations evolve constantly. Both the logical organization of the underlying database and the scientist's view of data may change rapidly. The underlying DBMS must provide appropriate support for the evolution of scientific simulations, their rapidly increasing computational intensity, as well as the growing volumes and dimensionality of scientific data. ADAMS is a dynamic and scalable academic DBMS for scientific applications designed to address the evolutionary processes and the problems of scale. This paper presents innovative solutions adopted in ADAMS allowing the system to accommodate the increasing computational intensity of scientific simulations as well as the growing volumes and dimensionality of scientific data View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource management in agent-based distributed environments

    Publication Year: 1999 , Page(s): 95 - 108
    Cited by:  Patents (11)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (576 KB)  

    This paper presents an agent-based architecture for optimally managing resources in distributed environments. The agent-based approach allows for maximal autonomy in agent negotiation and decision-making. A three-layer architecture is proposed, consisting of the user, agency and application domain layers. Agencies correspond to enterprise functional units, and agents are associated with agencies. A formal model of resources and constraints is presented, and it is shown that, under certain assumptions, optimal resource decompositions and allocations can be achieved. A distributed protocol is developed for agencies and agents to negotiate and exchange resources autonomously, while still satisfying both local and global constraints View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A semantic caching method based on linear constraints

    Publication Year: 1999 , Page(s): 133 - 140
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (332 KB)  

    Because performance is a crucial issue in database systems, data caching techniques have been studied in the database research field, especially in client-server databases and distributed databases. Recently, the idea of semantic caching has been proposed. The approach uses semantic information to describe cached data items so that it tries to exploit not only temporal locality but also semantic locality to improve query response time. We propose linear constraint-based semantic caching as a new approach to semantic caching. Based on the idea of constraint databases, we describe the semantic information about the cached relational tuples as compact constraint tuples. The main focus is the representation method of cache information and the cache examination algorithm View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OLAP query processing for partitioned data warehouses

    Publication Year: 1999 , Page(s): 35 - 42
    Cited by:  Papers (3)  |  Patents (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (312 KB)  

    On-line analytical processing (OLAP) queries can take hours or even days to execute on very large data warehouses. Therefore, there is a need to employ techniques that can facilitate efficient execution of these queries. The data partitioning concept that has been studied in the context of relational databases aims to reduce query execution time and facilitate the parallel execution of queries. In this paper, we develop a framework for applying the partitioning technique on DW schema (star schema) to reduce the total query execution cost. We develop an analytical cost model for executing a set of OLAP queries on a partitioned star schema. We conduct experiments to evaluate the utility of partitioning in efficiently executing OLAP queries. Finally, we show how partitioning can be used to facilitate parallel execution of OLAP queries View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Autonomous disks for advanced database applications

    Publication Year: 1999 , Page(s): 435 - 442
    Cited by:  Papers (8)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (300 KB)  

    The scalability and reliability of secondary storage systems are their most significant aspects for advanced database applications. Research on high-function disks has recently attracted a great deal of attention because technological progress now allows disk-resident data processing. This capability is not only useful for executing application programs on the disk, but is also suited for controlling distributed disks so they are scalable and reliable. We propose autonomous disks in the network environment by using the disk-resident data processing facility. A set of autonomous disks is configured as a cluster in a network, and data is distributed within the cluster, to be accessed uniformly by using a distributed directory. The disks accept simultaneous accesses from multiple hosts via a network, and handle data distribution and load skews. They are also able to tolerate disk failures and some software errors of disk controllers, and can reconfigure the cluster after the damaged disks are repaired. The data distribution, skew handling, and fault tolerance are completely transparent to hosts. The local communication means the size of the cluster is scalable. Autonomous disks are applicable to many advanced applications, such as a large Web server having many HTML files. We also propose to use rules to implement these functions, and we demonstrate their flexibility by examples of rules View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hard/soft deadline assignment for high workflow throughput

    Publication Year: 1999 , Page(s): 359 - 365
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (276 KB)  

    Many business processes which are abstracted to workflows have time constraints such that their processing should be completed within their deadlines. New time management technologies are therefore required for high workflow throughput which can maximize the number of workflow instances satisfying their deadlines. In this paper we propose an efficient deadline assignment method and validate its usefulness with experiments. In particular, the method divides activity deadlines into two categories, namely hard and soft deadlines according to the characteristics of activities. This can improve workflow throughput View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Providing high concurrency in object-oriented database systems

    Publication Year: 1999 , Page(s): 403 - 406
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (152 KB)  

    I present a scheme to increase concurrency among instance access methods in object-oriented database systems (OOBs). The proposed work has the following characteristics. First, the construction of the commutativity relation among methods can be automated. Second, it provides more concurrency by taking attributes as locking granularity. Third, deadlocks due to lock escalation can be reduced. Finally, concurrency is increased further with the use of run-time information. For the performance evaluation of the proposed scheme, an analytical model is constructed. Using this model, the proposed technique is then compared with the two existing techniques. The performance studies show that the proposed scheme is superior to existing works View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interacting with topological invariants of spatial databases

    Publication Year: 1999 , Page(s): 213 - 217
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (204 KB)  

    In this paper, we outline an interaction model for spatial databases, based on the exploitation of the topological invariant, a topological annotation of the spatial database. In particular, we consider zooming primitives suitable for browsing in massive sets of spatial data visualized in a fish-eye view fashion, and present their implementation in terms of manipulation of the topological invariant View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Similarity retrieval of human motion as multi-stream time series data

    Publication Year: 1999 , Page(s): 279 - 286
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (304 KB)  

    It is possible to acquire human motion as 3-dimensional time series data by the development of sensing technology in recent years. The DP matching method is well known for recognition of time series data such as voice. The similarity between two time series data can be measured by DP matching. However, since human motion data consists of multiple mutually-synchronized time series data, the similarity between two human motions needs to take into consideration not only the similarities between two person's motion data of the same part, but also two person's degrees of synchronizations of all the part's movements. This research aims to rate a user motion by measuring the similarity between the user motion and a teacher's model motion. By considering two types of similarities called movement similarity and synchronization similarity, we propose a way for measuring human motion similarity View full abstract»

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