OpenRaiser/Intern-Atlas huggingface dataset:
A Competition-Based Connectionist Model for Information Retrieval Using a Merged Thesaurus
Authors: Inien Syu, Sheau-Dong Lang
Venue: CIKM
Year: 1994

This paper investigates a network-based information retrieval model using diagnostic inferencing techniques. A basic inference network in information retrieval consists of two component networks: the document component and the query component. In our approach, there is a layer of nodes corresponding to the documents, and a layer of nodes corresponding to the index terms extracted from the document set, with links connecting documents to the related index terms 1. A thesaurus is used to provide concept categories; these categories are represented by another layer of nodes, with links connecting the index terms and the related categories 2. The query component uses a symmetric structure. Each query causes markings of category nodes, hence markings of the related index term nodes, in the document component of the network. In our previous work, we adapted a competition-based connectionist model for diagnostic problem solving to information retrieval. In this model, documents are treated as “disorders” and user information needs, represented by the marked index term nodes, as “manifestations”. A competitive activation mechanism is then used which converges to a set of disorders that best explain the given manifestations. Our experiments showed that the retrieval performance of this model is comparable to or better than that of various information retrieval models reported in the literature. In this paper, we report further enhancements of the model by using a merged thesaurus.
Preserving Update Semantics in Schema Integration
Authors: Vânia Maria Ponte Vidal, Marianne Winslett
Venue: CIKM
Year: 1994

In this paper, we propose a methodology for schema integration where the semantics of updates is preserved during the view integration process. We propose to divide view integration into three steps: combination, restructuring, and optimization. In the view combination step, we define the combined schema that contains all original views, plus a new set of constraints that express how data in distinct views are interrelated. The restructuring step is devoted to normalizing the views so that merging becomes possible. The optimization step tries to reduce redundancy and the size of the schema. Our methodology defines a set of transformation primitives that allows schema integration to be realized in a safe (information preserving) and algorithmic way. In the proposed transformation primitives, the relationship between the original and transformed schema is formally specified by the instance and update mappings. We introduce the notion of an update semantics preserving transformation, which guarantees that the relationships between each view and the global schema, originated during the view integration process, reflect exactly the relationships between the views as defined by the combined schema. In our approach, the view definition mappings and the view update translator can be directly defined from the instance and update mappings between the different intermediate schemas generated during the view integration process.
A Case for Reconfigurable Parallel Architectures for Information Retrieval
Authors: W. Addison Woods, H. Douglas Moser, Ophir Frieder, Paul B. Kantor
Venue: CIKM
Year: 1994

As the volume of data and computational requirements of modern information retrieval systems continue to expand, it is inevitable that parallel systems will be necessary to meet these demands. In this research, we provide a conceptual model of a reconfigurable parallel information retrieval system in a multicomputer environment. We develop strategies for scheduling queries in such systems, provide simulation results for implementing these strategies under various different theoretical situations, and present an analytical model of the system behavior.
Intelligent Query Answering in Deductive and Object-Oriented Databases
Authors: Suk-Chung Yoon, Il-Yeol Song, E. K. Park
Venue: CIKM
Year: 1994

In the near future, we believe that we will need much more sophisticated answer-finding schemes in an object-oriented database in order to satisfy the needs of truly intelligent information system. In this paper, we introduce a method to apply the intensional query processing techniques of deductive databases to object-oriented databases. So, we can generate intensional answers to represent answer-set abstractly for a given query in object-oriented databases.
Spatial Data Traversal in Road Map Databases: A Graph Indexing Approach
Authors: J. Leon Zhao, Ahmed Zaki
Venue: CIKM
Year: 1994

Spatial data are found in geographic information systems such as digital road map databases where city and road attributes are associated with nodes and links in a directed graph. Queries on spatial data are expensive because of the recursive property of graph traversal. We propose a graph indexing technique to expedite spatial queries where the graph topology remains relatively stationary. Using a probabilistic analysis, this paper shows that the graph indexing technique significantly improves the efficiency of constrained spatial queries.
A General Method for Spatial Reasoning in Spatial Databases
Authors: Alia I. Abdelmoty, Baher A. El-Geresy
Venue: CIKM
Year: 1995

Qualitative spatial reasoning is important in large spatial databases. It is based on the manipulation of qualitative spatial relationships and used to derive new spatial knowledge. Spatial reasoning has so far been studied only for simple areal objects. Spatial databases usually consists of objects of different types and complexity. In this paper, a general reasoning approach is proposed for deriving the composition of topological relationships between spatial objects of arbitrary complexity in any space dimension. The reasoning rules proposed are used to derive a new composition table between different types of spatial objects. The approach is a step towards the development of general spatial reasoning engine for handling different types of spatial relations in spatial databases. 1 Introduction 1 Spatial databases such as geographic databases in Geographic Information Systems (GIS), geometric databases in CAD, or image databases in Multimedia Information Systems and Medical Inform...
Semantics of an Extended Relational Model for Managing Uncertain Information
Authors: Vangalur S. Alagar, Fereidoon Sadri, Joseph N. Said
Venue: CIKM
Year: 1995

Article Free Access Share on Semantics of extended relational model for managing uncertain information Authors: V. S. Alagar Concordia University, Montreal, Canada Concordia University, Montreal, CanadaView Profile , F. Sadri University of North Carolina at Greensboro, Greensboro, NC University of North Carolina at Greensboro, Greensboro, NCView Profile , J. N. Said Concordia University, Montreal, Canada Concordia University, Montreal, CanadaView Profile Authors Info & Claims CIKM '95: Proceedings of the fourth international conference on Information and knowledge managementDecember 1995 Pages 234–240https://doi.org/10.1145/221270.221578Online:02 December 1995Publication History 2citation267DownloadsMetricsTotal Citations2Total Downloads267Last 12 Months5Last 6 weeks3 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 AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
The Role of Domain Knowledge in Data Mining
Authors: Sarabjot S. Anand, David A. Bell, John G. Hughes
Venue: CIKM
Year: 1995

ing results from the application of the STRIP algorithm in the actuarial domain.
Using Speculation to Reduce Server Load and Service Time on the WWW
Authors: Azer Bestavros
Venue: CIKM
Year: 1995

service implies that a client's request for a document is serviced by sending, in addition to the document requested, a number of other documents (or pointers thereto) that the server speculates will be requested by the client in the near future.
Experimental Evaluation of Dynamic Data Allocation Strategies in A Distributed Database with Changing Workloads
Authors: Anna Brunström, Scott T. Leutenegger, Rahul Simha
Venue: CIKM
Year: 1995

Traditionally, allocation of data in distributed database management systems has been determined by off-line anidysis and optimization. This technique works well for static database access patterns, but is often inadequate for frequently changing workloads. This paper addresses the problem of dynamically reallocating data in a partionable distributed database with changing access patterns. Rather than complicated and expensive optimization algorithms, a simple heuristic is presented and shown, via an implementation study, to improve system throughput by 3070 in a local area net work based system. For a wide area network the performance gain is expected to be even larger. It is also shown that individual site load must be taken into consideration when reallocating data. A a simple policy that incorporates load in the reallocation decision is provided.
The Characteristics of Digital Video and Considerations of Designing Video Databases
Authors: Chueh-Wei Chang, Keh-Feng Lin, Suh-Yin Lee
Venue: CIKM
Year: 1995

In this paper, a generic architecture of interactive video databases is proposed. It is a platform for video applications. It consists of six major modules : Video Indexing, Interactive Browser, Object Annotator, Query Processing Tool, Video Management Module and Content Retrieval Module. The considerations and requirements of the video database in the aspects of video data management, annotation capability, content-based query and browsing interfaces are described. This paper also describes a Video Object Description Model (VODM) for annotations. The notion of VODM is based on the Entity-Relationship model for the database conceptual level organization. Unlike keyword or framebased knowledge representation, VODM can record the detail attribute information about video objects, store and retrieve annotations in many different video files. To construct VODM, we give a recursive definition of the video object and describe the operations of annotation storage structures. A two-step query processing method is introduced that can reduce the processing time of each video object query.
Learning Subjective Relevance to Facilitate Information Access
Authors: James R. Chen, Nathalie Mathe
Venue: CIKM
Year: 1995

As the amount of available electronic information is dramatically increasing, the ability for rapid and effective access to information has become critical. Most traditional information access methods rely on measures of relevance based on information content. We propose a new approachwhich augments existing information access methods with subjective relevance learned from user feedback. We developed an adaptive system which helps users access information by employing learned knowledge about which documents are likely to be relevant, given the current user&apos;s information need and user profile. This system is based on a model, called a relevance network,which learns and generalizes relevance information in a rapid, cost-effective, and incremental manner. We present the design of the relevance network and results of experimental evaluation.
On Isolation, Concurrency, and the Venus Rule Language
Authors: Stephen Correl, Daniel P. Miranker
Venue: CIKM
Year: 1995

Article On isolation, concurrency, and the Venus rule language Share on Authors: Stephen Correl Department of Computer Sciences and the Applied Research Laboratories, University of Texas at Austin, Austin, Texas Department of Computer Sciences and the Applied Research Laboratories, University of Texas at Austin, Austin, TexasView Profile , Daniel P. Miranker Department of Computer Sciences and the Applied Research Laboratories, University of Texas at Austin, Austin, Texas Department of Computer Sciences and the Applied Research Laboratories, University of Texas at Austin, Austin, TexasView Profile Authors Info & Claims CIKM '95: Proceedings of the fourth international conference on Information and knowledge managementDecember 1995 Pages 281–289https://doi.org/10.1145/221270.221591Published:02 December 1995 5citation213DownloadsMetricsTotal Citations5Total Downloads213Last 12 Months2Last 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 AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
An Efficient and Reliable Reservation Algorithm for Mobile Transactions
Authors: Ahmed K. Elmagarmid, Jin Jing, Omran A. Bukhres
Venue: CIKM
Year: 1995

In a mobile computing environment, a user carrying a portable computer can execute a mobile tmnsaction by submitting the operations of the transaction to distributed data servers from different locations.
Experimenting with Temporal Relational Databases
Authors: Iqbal A. Goralwalla, Abdullah Uz Tansel, M. Tamer Özsu
Venue: CIKM
Year: 1995

In this paper we describe an implementation of a temporal relational database management system based on attribute timestamping. The algebraic language of the system includes relational algebra operators, restructuring operators and temporal operators. We then use this system to carry out experiments on the performance of different types of temporal databases: databases using attribute timestamping, databases using tuple timestamping where relations are in temporal normal form and databases using tuple timestamping where a single relation is used. We run sample queries against these types of temporal databases and measure the processing time of these queries. This study verifies that the major performance trade off between different types of temporal databases is between the restructuring (unpack) operation needed in temporal databases using attribute timestamping and the join operation needed in temporal databases using tuple timestamping. Furthermore, the experiments show that keepin...
Application of Knowledge Base Design Techniques to Genetic Markers
Authors: Mark Graves
Venue: CIKM
Year: 1995

Knowledge bases can be quickly accepted mto realistic settings if they are developed rapidly and they support critical tasks.Genetics is one area where knowledge management is necessary to prowde intelligent access to complex mtformatlon.Multiple reasoning systems accessing the same knowledge base can contribute directly to the progress of science.Genetics is a rapidly changing field and the rap]d development of intelligent systems is becommg cmcial for the analysis of information.Genetic data is also being generated at an exponentially growing rate and traditional techniques are being overwhelmed, A flexible knowledge base which stores the information and makes it available to a variety of reasoning systems will speed up the transition of laboratory research to medical practice.We have developed a process for designing data models for application-specific knowledge bases.This process is supported by a knowledge base design tool, which we call WEAVE, that creates a prototype knowledge base when given a data model definition by a knowledge base developer.The process is formalized using theoretical results from knowledge representation and programming language theory.This mix of theoretical results and-their integration in an implemented system has proven useful for a real-world application.We show how our knowledge base design process can be used to develop a data model for genetic markers, which are biological constructs used to search for genes associated with genetic diseases.
Error Propagation in Distributed Databases
Authors: Oliver Haase, Andreas Henrich
Venue: CIKM
Year: 1995

research area for distributed database systems is inaccessibility.
Scheduling and Mapping for Parallel Execution of Extended SQL Queries
Authors: Abdelkader Hameurlain, Franck Morvan
Venue: CIKM
Year: 1995

In this paper, we present an extension of PSA strategy (Parallel Scheduling Algorithm ), to determine an appropriate mapping of operations onto physical processors, taking into account the interconnection network topology of a sharednothing architecture. Performance evaluation, which relies on two benchmarks shows the efficiency of PSA strategy by comparing to Static Right-Deep strategy and to Bushy Tree Scheduling strategy. The major contributions of this work are (i) the incorporation of the mapping process into PSA strategy and (ii) the PSA strategy which provides a good trade-off between response time minimization and throughput maximization. 1 Introduction The problem of ESQL [9] queries optimization for parallel execution is fundamental to obtain high performance and high data availability. One way to increase optimization capacity is to improve the efficiency of generating an optimal execution plan. The design of an ESQL queries Optimizer may be decomposed into three dimension...
Mining Knowledge at Multiple Concept Levels
Authors: Jiawei Han
Venue: CIKM
Year: 1995

Most studies on data mining have been focused at mining rules at single concept levels, i.e,, either at the primitive level or at a rather high concept level. However, it is often desirable to discover knowledge at multiple concept levels. Mining knowledge at multiple levels may help database users find some interesting rules which are difficult to be discovered otherwise and view database contents at different abstraction levels and from different angles. Methods for mining knowledge at multiple concept levels can often be developed by extension of existing data mining techniques. Moreover, for eficient processing and interactive mining of multiple-level rules, it is often necessary to adopt techniques such as step-by-step generalization/specialization or progressive deepening of a knowledge mining process. Other issues, such as visual representation of knowledge at multiple levels, and “redundant” rule filtering, should also be studied in depth.
The Index Suggestion Problem for Object Database Applications
Authors: Eric Hughes, Marianne Winslett
Venue: CIKM
Year: 1995

The index suggestion problem for an object database management system (ODBMS) application is to automatically identify indexes which may speed up the application.
Computation of Partial Query Results Using An Adaptive Stratified Sampling Technique
Authors: Augustine C. Ikeji, Farshad Fotouhi
Venue: CIKM
Year: 1995

The proliferation of databases into many areaa has resulted in the need for fast and efficient techniques for query processing.
A New Parallel Signature File Method for Efficient Information Retrieval
Authors: Jeong-Ki Kim, Jae-Woo Chang
Venue: CIKM
Year: 1995

The signature file method has been widely advocated as an efficient index scheme to handle new abdications demand-. .
Consortium: A Framework for Transaction Collaborative Environments
Authors: Vram Kouramajian, Ross Dargahi, Jerry Fowler, Donald G. Baker
Venue: CIKM
Year: 1995

Article Free Access Share on Consortium: a framework for transactions in collaborative environments Authors: Vram Kouramajian Knight-Ridder Information, Inc., Mountain View, CA and Information Technology Development, Rice University, Houston, Texas Knight-Ridder Information, Inc., Mountain View, CA and Information Technology Development, Rice University, Houston, TexasView Profile , Ross Dargahi Knight-Ridder Information, Inc., Mountain View, CA and Information Technology Development, Rice University, Houston, Texas Knight-Ridder Information, Inc., Mountain View, CA and Information Technology Development, Rice University, Houston, TexasView Profile , Jerry Fowler Center for Information Infrastructure and Computing Sciences, Baylor College of Medicine, Houston, TX and Information Technology Development, Rice University, Houston, Texas Center for Information Infrastructure and Computing Sciences, Baylor College of Medicine, Houston, TX and Information Technology Development, Rice University, Houston, TexasView Profile , Donald Baker Information Technology Development, Rice University, Houston, Texas Information Technology Development, Rice University, Houston, TexasView Profile Authors Info & Claims CIKM '95: Proceedings of the fourth international conference on Information and knowledge managementDecember 1995 Pages 260–265https://doi.org/10.1145/221270.221585Published:02 December 1995Publication History 1citation325DownloadsMetricsTotal Citations1Total Downloads325Last 12 Months0Last 6 weeks0 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 AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Data Broadcasting Strategies over Multiple Unreliable Wireless Channels
Authors: Hong Va Leong, Antonio Si
Venue: CIKM
Year: 1995

Article Free Access Share on Data broadcasting strategies over multiple unreliable wireless channels Authors: Hong V. Leong Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong KongView Profile , Antonio Si Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong KongView Profile Authors Info & Claims CIKM '95: Proceedings of the fourth international conference on Information and knowledge managementDecember 1995 Pages 96–104https://doi.org/10.1145/221270.221339Published:02 December 1995Publication History 30citation412DownloadsMetricsTotal Citations30Total Downloads412Last 12 Months3Last 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 AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
PERF Join: An Alternative to Two-way Semijoin and Bloomjoin
Authors: Zhe Li, Kenneth A. Ross
Venue: CIKM
Year: 1995

Article Free Access Share on PERF join: an alternative to two-way semijoin and bloomjoin Authors: Zhe Li Department of Computer Science, Columbia University, New York, NY Department of Computer Science, Columbia University, New York, NYView Profile , Kenneth A. Ross Department of Computer Science, Columbia University, New York, NY Department of Computer Science, Columbia University, New York, NYView Profile Authors Info & Claims CIKM '95: Proceedings of the fourth international conference on Information and knowledge managementDecember 1995 Pages 137–144https://doi.org/10.1145/221270.221360Published:02 December 1995Publication History 26citation554DownloadsMetricsTotal Citations26Total Downloads554Last 12 Months45Last 6 weeks5 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 AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF