OpenRaiser/Intern-Atlas huggingface dataset:
Semantics-Based Information Brokering
Authors: Vipul Kashyap, Amit P. Sheth
Venue: CIKM
Year: 1994

The rapid advances in computer and communication technologies, and their merger, is leading to a global information market place. It will consist of federations of very large number of information systems that will cooperate to varying extents to support the users' information needs. We discuss an approach to information brokering in the above environment. We discuss two of its tasks: information resource discovery, which identifies relevant information sources for a given query, and query processing, which involves the generation of appropriate mapping from relevant but structurally heterogeneous objects. Query processing consists of information focusing and information correlation. Our approach is based on: semantic proximity, which represents semantic similarities based on the context of comparison, and schema correspondences which are used to represent structural mappings and are associated with the context. The context of comparison of the two objects is the primary vehicle to represent the semantics for determining semantic proximity. Specifically, we use a partial context representation to capture the semantics in terms of the assumptions in the intended use of the objects and the intended meaning of the user query. Information focusing is supported by subsequent context comparison. The same mechanism can be used to support information resource discovery. Context comparison leads to changes in schema correspondences that are used to support information correlation.
XEL: Extended Ephemeral Logging for Log Storage Management
Authors: John S. Keen, William J. Dally
Venue: CIKM
Year: 1994

Extended ephemeral logging (XEL) is a more general variation of the ephemeral logging (EL) technique for managing a log of database activity on disk; it does not require a timestamp to be maintained with each object in the database. XEL does not require periodic checkpoints and does not abort lengthy transactions as frequently as traditional firewall logging for the same amount of disk space. Therefore, it is well suited for concurrent databases and applications which have a wide distribution of transaction lifetimes.
Functionality and Architecture of a Cooperative Database System: A Vision
Authors: Thomas Kirsche, Richard Lenz, Hans Schuster
Venue: CIKM
Year: 1994

A database system fostering the cooperative usage and modification of a common data pool should provide standard database functionality (e.g. application-independent correctness criteria and data modelling) plus means for a step-wise, cooperative refinement of data over a long period of time. Key ingredients are a hierarchical organization of work, a sound data model covering cooperative uncertainly, and support for long-living cooperative processes. Furthermore, mechanisms for data passing and hiding, negotiation means, and notification are of prominent importance. In the paper, the rationale behind such a functionality is described. Furthermore, a proposal is made for the software architecture of what is called a cooperative database system (CDBMS).
The Time Index+: An Incremental Access Structure for Temporal Databases
Authors: Vram Kouramajian, Ibrahim Kamel, Ramez Elmasri, Syed Waheed
Venue: CIKM
Year: 1994

Article Free Access Share on The time index+: an incremental access structure for temporal databases Authors: Vram Kouramajian Department of Computer Science, The Wichita State University, Wichita, Kansas Department of Computer Science, The Wichita State University, Wichita, KansasView Profile , Ibrahim Kamel Department of Computer Science, University of Maryland, College Park, Maryland Department of Computer Science, University of Maryland, College Park, MarylandView Profile , Ramez Elmasri Computer Science Engineering Department, The University of Texas at Arlington, Arlington, Texas Computer Science Engineering Department, The University of Texas at Arlington, Arlington, TexasView Profile , Syed Waheed Computer Science Engineering Department, The University of Texas at Arlington, Arlington, Texas Computer Science Engineering Department, The University of Texas at Arlington, Arlington, TexasView Profile Authors Info & Claims CIKM '94: Proceedings of the third international conference on Information and knowledge managementNovember 1994 Pages 296–303https://doi.org/10.1145/191246.191298Online:29 November 1994Publication History 17citation423DownloadsMetricsTotal Citations17Total Downloads423Last 12 Months6Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Query Expansion Using Domain Adapted, Weighted Thesaurus in an Extended Boolean Model
Authors: Oh-Woog Kwon, Myoung-Cheol Kim, Key-Sun Choi
Venue: CIKM
Year: 1994

In this paper, we address there important issues with query expansion using a thesaurus; how to give weights to the terms in expanded queries, how to select additional search terms in the thesaurus, and how to enrich the terms in the manual thesaurus (namely, thesaurus reconstruction). To weight the terms in expanded queries, we construct the weighted thesaurus that has a similarity value between the terms in the thesaurus, using statistical co-occurrence in a corpus. To enrich the terms in the manual thesaurus, domain dependent terms which occur in a corpus are inserted into the weighted thesaurus using the co-occurrence information. In this paper, the reconstructed thesaurus with weights is defined as a domain-adapted, weighted thesaurus. Then we explain query expansion using the domain-adapted, weighted thesaurus in an extended Boolean retrieval model. To select additional search terms during query expansion, our model uses semi-automatic query expansion and a restriction method. In the experiments, our system had almost twice the recall of the boolean retrieval system not using the thesaurus or the query expansion retrieval system using the original thesaurus. And also, the precision of our system was almost the same precision as the other systems.
A Semantics Approach for KQML - A General Purpose Communication Language for Software Agents
Authors: Yannis Labrou, Timothy W. Finin
Venue: CIKM
Year: 1994

We investigate the semantics for Knowledge Query Manipulation Language (KQML) and we propose a semantic framework for the language. KQML is a language and a protocol to support communication between software agents. Based on ideas from speech act theory, we propose a semantic description for KQML that associates descriptions of the cognitive states of agents with the use of the language's primitives (performatives). We use this approach to describe the semantics for the basic set of KQML performatives. We also investigate implementation issues related to our semantic approach. We suggest that KQML can offer an all purpose communication language for software agents that requires no limiting pre-commitments on the agents' structure and implementation. KQML can provide the Distributed AI, Cooperative Distributed Problem Solving and Software Agents communities with an all purpose language and environment for intelligent inter-agent communication.
Application of a Symbolico-Connectionist Approach for the Design of a Highly Interactive Documentary Database Interrogation System with On-Line Learning Capabilities
Authors: Jean-Charles Lamirel, Marion Créhange
Venue: CIKM
Year: 1994

The NOMAD system is a documentary database interrogration system based on a symbolico-connectionist approach.NOMAD makes use of the synthesis capabilities and flexibility inherent in this type of approach to increase its processing power as compared as compared to existing systems while proposing new operating modes directly accessible to a large number of users:•NOMAD manages multiple synthetic type views on its documentary contents in the form of neural topographies acting as case-memories as well as elaborated thematic browsing tools.•NOMAD manages a session memory based on the neural model of the novelty detector with the following three functions: cumulative recording of user need, managing user contradictions and proposing new orientations.•NOMAD also has extended learning capabilities, enabling it to improve its performance in the long term.In the introduction of this article, we justify the modelling choices made for NOMAD. The system will then be described in detailed, stressing the new possibilities regarding help in query formulation and improvement in retrieval performance. The evaluation campaign and the numerous evolution perspectives provided by the model are described in the final section.
Using Path Information for Query Processing in Object-Oriented Database Systems
Authors: Dik Lun Lee, Wang-Chien Lee
Venue: CIKM
Year: 1994

This paper argues that most queries in object-oriented databases require traversing from one object to another in the aggregation hierarchy. Thus, the connections between objects through object identifiers are essential to the efficiency of query processing and should be represented separately from the database. We introduce the concept of path dictionary and describe how it supports queries of different types. We evaluate the storage overhead, query and update costs of the path dictionary. Compared to the path index, the path dictionary has better overall query and update performance and lower storage overhead.
Computer Image Retrieval by Features: Selecting the Best Facial Features for Suspect Identification Systems
Authors: Eric S. Lee, Thomas Whalen
Venue: CIKM
Year: 1994

Correct suspect identification of known offenders by witnesses deteriorates rapidly as more are examined in mugshot albums. Feature approaches, where mugshots are displayed in order of similarity to witnesses' descriptions, increase identification success by reducing this number. System performance depends on selection of system features. Four methods of selecting features are evaluated empirically: theory, random, hill-climbing algorithm, and hybrid. The theory asserts success depends on five properties of system features: informativeness, orthogonality, sufficiency, consistency, and observability. Comparing system performance on the best 10 features selected (from a pool of 90) by each method supports our contention. In four experimental tests of a system with 1000 official mugshots, over 90% of witness searches resulted in photos of target suspects retrieved in the first ten mugshots displayed for examination (using all 90 system features). On average, suspects were retrieved in the first 54, 7, 22, and 70 mugshots when using only the best 10 model features. Hybrid and hill-climbing algorithms did not improve on this performance, and performance of randomly selected sets of 10 features was poor.
The EGG/YOLK Reliability Hierarchy : Semantic Data Integration Using Sorts with Prototypes
Authors: Fritz Lehmann, Anthony G. Cohn
Venue: CIKM
Year: 1994

Integration of disparate heterogeneous databases requires translation of types. Because a type in one system often has no exact counterpart in the others, fully reliable integration requires deep understanding of the subject domain, with conceptual analysis of type meanings. So far, reliable translation has had to be done by hand. In practice, few types are so crucial as to require full reliability. The EGG/YOLK hierarchy ranks types by the tolerable rashness in translation, based on prototypes in each type. Each defined class (EGG) has a subclass of typical members (YOLK) defined. We exploit Cui, Cohn and Randell's Qualitative Spatial Simulation program to create the hierarchy of all possible relations between source and target EGG/YOLK types, ranked by reliability. Our eventual ranking is based on a poset combining four different preference criteria.
Design and Evaluation Rules for Building Adaptive Schema in an Object-Oriented Data and Knowledge Base System
Authors: Ling Liu
Venue: CIKM
Year: 1994

We develop a selection of design and evaluation rules for building an adaptive schema in an object-oriented data and knowledge base system. This set of style rules include not only those which we use to preserve validity and minimality of an object-oriented schema, but also those which help us to promote extensibility, reusability and adaptiveness of an object-oriented schema against future requirement changes. We encourage to use the set of style rules proposed as a means for validating quality of a schema, and for transforming an object-oriented schema into a better style regarding to adaptiveness and robustness, rather than as a user-oriented method solely for designing the schema.
Algebraic Equivalences Among Nested Relational Expressions
Authors: Hong-Cheu Liu, Kotagiri Ramamohanarao
Venue: CIKM
Year: 1994

Algebraic optimization is both theoretically and practically important for query processing in (nested) relational databases. In this paper, we consider this issue and investigate some algebraic properties concerning the nested relational operators. We also outline a heuristic optimization algorithm for nested relational expressions by adopting algebraic transformation rules developed in this paper and previous related work.
TID Hash Joins
Authors: Robert Marek, Erhard Rahm
Venue: CIKM
Year: 1994

TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash table instead of entire ttrples. This typically reduces memory requirements by more than art order of magnitude bringing substantial benefits. In particular, performance for joins on Gigs-Byte relations can substantially be improved by reducing the amount of disk f/O to a large extent. Furthermore, efficient processing of mixed multi-user workloads consisting of both join queries and OLTP transactions is supported. We present a detailed simulation study to analyze the performance of TID hash joins. In particular, we identify the conditions under which TID hash joins are most beneficial. Furthermore, we compare TID hash join with adaptive hash join algorithms that have been proposed to deal with mixed workloads.
On the Storage and Retrieval of Continuous Media Data
Authors: Banu Özden, Rajeev Rastogi, Abraham Silberschatz
Venue: CIKM
Year: 1994

Continuous media applications, which require a guaranteed transfer rate of the data, are becoming an integral part of daily computational life. However, conventional file systems do not provide rate guarantees, and are therefore not suitable for the storage and retrieval of continuous media data (e.g., audio, video). To meet the demands of these new applications, continuous media file systems, which provide rate guarantees by managing critical storage resources such as memory and disks, must be designed.
Isolation of Transaction Aborts in Object-Oriented Database Management Systems
Authors: Shankar Pal, Sitaram Lanka
Venue: CIKM
Year: 1994

We address the problem of recovery in object-oriented data-bases from considerations of the semantics of committed transactions and the efficiency of recovery procedures. The recovery strategy used is update-in-place. We show that efficient recovery procedures should allow transactions to abort independently of one another by executing inverse operations. We refer to these requirements collectively as the recovery isolation property. We present a formal definition of recovery isolation and prove that schedules possessing this property do not suffer from rollback dependencies. Recovery isolation is useful in constructing concurrency control protocols that go beyond commutativity, and in parallel and high performance database systems. We define the notion of strict schedules for object-oriented databases as an extension of the analogous definition for read and write operations. We show that strict schedules possess the recovery isolation property.
Towards a Framework for Integrating Multilevel Secure Models and Temporal Data Models
Authors: Niki Pissinou, Kia Makki, E. K. Park
Venue: CIKM
Year: 1994

Within many organizations the number of databases containing classified or otherwise sensitive data is increasing rapidly. Access to these databases must be restricted and controlled to limit the unauthorized disclosure, or malicious modification of data contained in them. However, the conventional models of authorization that have been designed for database systems supporting the hierarchical, network and relational models of data do not provide adequate mechanisms to support controlled access of temporal objects and context based temporal information. In this paper we extend the multilevel secure relational model to capture the functionality required of a temporal database, i.e. a database that supports some aspect of time, not counting user-defined time. In particular we assign class access to bitemporal timestamped attributes, and give explicit security classifications to temporal elements.
Building Information Systems for Mobile Environments
Authors: Evaggelia Pitoura, Bharat K. Bhargava
Venue: CIKM
Year: 1994

It is expected that in the near future, tens of millions of users will have access to distributed information systems through wireless connections. The technical characteristics of the wireless medium and the resulting mobility of both data resources and data consumers raise new challenging questions regarding the development of information systems appropriate for mobile environments. In this paper, we report on the development of such a system. First, we describe the general architecture of the information system and the main considerations of our design. Then, based on these considerations, we present our system support for maintaining the consistency of replicated data and for providing transaction schemas that account for the frequent but predictable disconnections, the mobility, and the vulnerability of the wireless environment.
Multiversion Divergence Control of Time Fuzziness
Authors: Calton Pu, Miu K. Tsang, Kun-Lung Wu, Philip S. Yu
Venue: CIKM
Year: 1994

Epsilon Serializability (ESR) has been proposed to manage and control inconsistency in extending the classic transaction processing. ESR increases system concurrency by tolerating a bounded amount of inconsistency. In this paper, we present multiversion divergence control (mvDC) algorithms that support ESR with not only value but also time fuzziness in multiversion databases. Unlike value fuzziness, accumulating time fuzziness is semantically different. A simple summation of the length of two time intervals may either underestimate the total time fuzziness, resulting in incorrect execution, or overestimate the total time fuzziness, unnecessarily degrading the effectiveness of mvESR. We present a new operation, called TimeUnion, to accurately accumulate the total time fuzziness. Because of the accurate control of time and value fuzziness by the mvDC algorithm, mvESR is very suitable for the use of multiversion databases for real-time applications that may tolerate a limited degree of data inconsistency but prefer more data recency.
A Lock Method for KBMSs Using Abstraction Relationships' Semantics
Authors: Fernando de Ferreira Rezende, Theo Härder
Venue: CIKM
Year: 1994

Knowledge Base Management Systems (KBMSs) are a growing research area finding applicability in different domains. As a consequence, the demand for ever-larger knowledge bases (KBs) is growing more and more. Inside this context, knowledge sharing turns out to be a crucial point to be supported by KBMSs. In this paper, we propose a way of controlling knowledge sharing. We show how we obtain serializability of transactions providing many different locking granules, which are based on the semantics of the abstraction relationships. The main benefit of our technique is the high degree of potential concurrency, to be obtained through a logical partitioning of the KB graph and the provision of lock types used for each referenced partition. By this way, we capture more of the semantics contained in a KB graph, through an interpretation of its edges grounded in the abstraction relationships, and make feasible a full exploitation of all inherent parallelism in a knowledge representation approach.
Hierarchical Classification as an Aid to Database and Hit-List Browsing
Authors: J. Royce Rose, Johann Gasteiger
Venue: CIKM
Year: 1994

A navigational aid for databases that relies on unsupervised hierarchical classification is presented. The approach to hierarchical classification, based on both functional and topological features, supports the creation of deep hierarchies in which succeeding levels represent increasing degrees of abstraction. This allows the user to quickly evaluate the result of a query and to locate interesting items and classes of items by performing a tree traversal rather than a sequential perusal of a hit list or a series of ad hoc query refinements. In very large databases where classical querying methods are increasingly inadequate such as chemical reaction databases, such a browsing method is required in order to manage the flood of information with which the user is confronted.
Performance of Clustering Policies in Object Bases
Authors: Adel Shrufi
Venue: CIKM
Year: 1994

In this paper, we address the problem of clustering graphs in object-oriented databases. Unlike previous studies which focused only on a workload consisting of a single operation, this study tackles the problem when the workload is a set of operations (method and queries) that occur with a certain probability. Thus, the goal is to minimize the expected cost of an operation in the workload, while maintaining a similarly low cost for each individual operation class.
Adaptive Commitment for Distributed Real-Time Transactions
Authors: Nandit Soparkar, Eliezer Levy, Henry F. Korth, Abraham Silberschatz
Venue: CIKM
Year: 1994

Distributed real-time transaction systems are useful for both real-time and high-performance database applications. Standard transaction management approaches that use the two-phase commit protocol suffer from its high costs and blocking behavior which is problematic in real-time computing environments. Our approach in this paper is to identify ways in which a commit protocol can be made adaptive in the sense that under situations that demand it, such as a transient local overload, the system can dynamically change to a different commitment strategy. The decision to do so can be taken autonomously at any site. The different commitment strategies exploit a trade-off between the cost of commitment and the obtained degree of atomicity. Our protocols are based on optimistic commitment strategies, and they rely on local compensatory actions to recover from non-atomic executions. We provide the necessary framework to study the logical and temporal correctness criteria, and we describe examples to illustrate the use of our strategies.