OpenRaiser/Intern-Atlas huggingface dataset:
A Distributed, Graphical, Topic-Oriented Document Search System
Authors: John Light
Venue: CIKM
Year: 1997

With the increasing numbers of documents available from the Internet and other sources, finding anything is becoming increasingly difficult. This paper presents a new approach to finding documents that relies on compelling graphic presentations to the user. By creating compact representations of documents that can be easily transferred between computers, the approach allows the search process to occur on the user's desktop, distant from where the original documents are stored or where the indexes are created. Besides allowing searching to scale better to large numbers of information consumers, this allows the full graphical capabilities of tbe desktop computer to be applied to the problem.
Using a Sequential Index in Terrain-Aided Navigation
Authors: Ling Lin, Tore Risch
Venue: CIKM
Year: 1997

Terrain-aided navigation is a database application in which an aeroplane locates itself by matching the height trajectory with a terrain-elevation map on board the aircraft. Without an index a matching algorithm has to be applied to the whole map. This paper shows that an indexing technique, termed the IP-index, can efficiently filter out sub-areas of the map to provide starting positions for the matching algorithm (to improve the efficiency). Performance measurements of the IP-index in terrain-aided navigation are given in this paper. The IP-index is a dynamic indexing technique for large 1-D sequences on the value domain. It supports interpolation assumptions on the sequences, i.e., it can be used to query implicit values in addition to explicit values. It can be implemented by regular ordered indexes such as B-trees.
A Framework for Global Optimization of Aggregate Queries
Authors: Chengwen Liu, Andrei Ursu
Venue: CIKM
Year: 1997

With recent emphasis placed by data warehouse applications on aggregate queries with vatious grouping criteria, it is natural to expect muhiple aggregate queries on the same set of tables. In this paper, we provide a fmmework for global optimization of aggregate queries under the concept of aggregate query blocks. We propose an extension to SQL to allow users to define explicit query blocks. The paper coveys the integration of the gZobaZ aggregate optimization with the oprimization of individual queries. We present easy-to-implement optimization algolithms applicable to aggregate query blocks. We show that these algorirhms add minimum overhead to the fofai optimization cost, whiie dramatically reducing the overall execution cost.
Efficient Global Probabilistic Deduction from Taxonomic and Probabilistic Knowledge-Bases over Conjunctive Events
Authors: Thomas Lukasiewicz
Venue: CIKM
Year: 1997

<p>We present a new, efficient linear programming approach to probabilistic deduction from probabilistic knowledge bases over conjunctive events. We show that this approach enables us to solve the classical problem of probabilistic deduction along a chain of basic events in polynomial time in the length of the chain. We then elaborate how taxonomic knowledge can be exploited in our new approach for an increased efficiency. We also present important new results for the classical linear programming approach to probabilistic deduction under taxonomic knowledge.</p>
Dealing with Partial Failures in Multiple Processor Primary-Backup Systems
Authors: Sharad Mehrotra, Kexiang Hu, Simon M. Kaplan
Venue: CIKM
Year: 1997

Remote backup systems provide database availability even in case of disasters that cause complete database failure. In a remote backup system a backup tracks the transaction processing at the primary and in the event of the primary failure takes over transaction processing without causing users to observe a breach in service. Remote backup algorithms have been developed for a variety of system architectures including the case in which primary and backup consist of multiple processors connected via multiple communication lines. A limitation of existing algorithms for such environments is that they ignore the issue of partial primary and backup failures in which one or more of the primary#backup processors fail but the system as a whole survives. This paper describes the design of a primary backup system which uses the backup to provide continued availability not only during disasters but also during partial failures. The key to the approach is a non-blocking two-phase commit protocol ad...
Evaluating Triggers Using Decision Trees
Authors: Lance Obermeyer, Daniel P. Miranker
Venue: CIKM
Year: 1997

This paper presents an algorithm for implementing rule filtering in active and trigger enabled databases. The algorithm generates one or more decision trees that determine what rules or triggers might be enabled by an individual database element, reducing the number of rules or triggers that must be evaluated. The algorithm operates by symbolically representing the space of database elements and subdividing the space based on rule predicates. Regions of the state space represent particular combinations of enabled rules. Decision trees are then generated based on the subdivided state space. The trees have the important property that no individual test is repeated. The ordered binary decision diagram (BDD) data structure is used to represent and manipulate the state space. 1. Introduction Modern database systems increasingly support active behavior through rules. This support ranges from simple database triggers to complete active database functionality. Rules typically follow the even...
Mining Association Rules with Adjustable Accuracy
Authors: Jong Soo Park, Philip S. Yu, Ming-Syan Chen
Venue: CIKM
Year: 1997

Article Mining association rules with adjustable accuracy Share on Authors: Jong Soo Park Dept of Comput. Sci., Sungshin Women's Univ., Seoul, Korea Dept of Comput. Sci., Sungshin Women's Univ., Seoul, KoreaView Profile , Philip S. Yu IBM T.J. Watson Res. Ctr., P.O. Box 704, Yorktown, NY IBM T.J. Watson Res. Ctr., P.O. Box 704, Yorktown, NYView Profile , Ming-Syan Chen Elect. Eng. Department, National Taiwan Univ., Taipei, Taiwan, ROC Elect. Eng. Department, National Taiwan Univ., Taipei, Taiwan, ROCView Profile Authors Info & Claims CIKM '97: Proceedings of the sixth international conference on Information and knowledge managementJanuary 1997 Pages 151–160https://doi.org/10.1145/266714.266886Online:01 January 1997Publication History 20citation444DownloadsMetricsTotal Citations20Total Downloads444Last 12 Months3Last 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 SiteGet Access
Generating Association Rules from Semi-Structured Documents Using an Extended Concept Hierarchy
Authors: Lisa Singh, Peter Scheuermann, Bin Chen
Venue: CIKM
Year: 1997

Most data mining research has focused on generating rules within databases containing structured values while essentially ignoring the potentially valuable information that exists in the unstructured blocks of text. This paper suggests an approach for generating association rules that relates structured data values to concepts extracted from unstructured data. Our approach involves the use of an extended concept hierarchy (ECH) to maintain parent, child, and sibling relationships between concepts. This structure allows us to generate rules that relate a given concept in the ECH and a given structured attribute value to the neighbors of the given concept in the ECH. We also describe an efficient implementation of the ECH that keeps track of concepts and pointers to documents associated with them. Experimental results on documents from the ABI/Inform Information Retrieval System are presented. 1 Introduction With the abundant amounts of information available to businesses today, an urg...
Global Nested Transaction Management for ODMG-Compliant Multi-Database Systems
Authors: Thomas Tesch, Jürgen Wäsch
Venue: CIKM
Year: 1997

Object technology has received considerable attention in the recent years for the integration of various local data sources in a multi-database system (MDBS). An object-oriented data model like ODMG-93 can serve as the canonical data model for the global layer in the MDBS. The ODMG-93 standard defines a closed nested ACID transaction model without intra-transaction parallelism. Although the nested transaction model provides special support for distributed computing environments, the implications of its usage as a global transaction model for MDBS have so far not been examined. In this paper, we present a simple and practical method to implement global nested transaction management for ODMG-compliant multi-database systems. The main contribution of our work is the adaption of the ticket method to achieve global serializability for global nested transactions that conform to ODMG. Our approach is also applicable to OMG&apos;s common object request broker architecture. We have succesfully impl...
Retrieving Video Data Via Motion Tracks of Content Symbols
Authors: Tim T. Y. Wai, Arbee L. P. Chen
Venue: CIKM
Year: 1997

Motion is the major feature that differentiates a video from a still image. In content-based retrieval, the motion track of a symbol object can be used as an index of video databases. Query processing based on such index can be treated as a curve matching problem. Two important criteria for solving the problem are sub-matching and approximate-matching. In this paper, two query processing approaches are proposed. The first approach expands the motion track index to a region and allows a user to query against this region. In the second approach, both the motion track index and the query curve are modeled as a combination of peaks and each peak is coded according to its orientation, angle and temporal information. The curve matching problem is then converted into a string matching problem, which is solved efficiently by a new finite automata based method. The proposed string matching algorithm is also shown to be scalable to the growth of the size of the database. 1.
Exploiting Enterprise Models for the Automatic Distribution of Corporate Information
Authors: Michael Wolverton
Venue: CIKM
Year: 1997

Effectively distributing information to members of a large organization poses a number of challenges. Ideal information distribution within an organization will be timely, selective, and (to some degree) automatic. It is difficult to meet all three of these criteria simultaneously using existing techniques in information retrieval and information filtering. This paper introduces a new method of distributing information automatically, based on enterprise models --- representations of the pertinent aspects of an organization&apos;s structure and operation. The approach is based on the premise that often information needs within an organization are implicitly represented by paths through the enterprise model. These paths are discovered in our approach through the use of Generalized Path Models (GPMs). A GPM specifies (1) the conditions that instigate a path search when new information is created, (2) a general class of paths for which to search, and (3) an action to take when a suitable path is f...
Intensional Query Processing Using Data Mining Approaches
Authors: Suk-Chung Yoon, Il-Yeol Song, E. K. Park
Venue: CIKM
Year: 1997

Article Free Access Share on Intensional query processing using data mining approaches Authors: S. C. Yoon Dept. of Computer Science, Widener University, Chester, PA Dept. of Computer Science, Widener University, Chester, PAView Profile , I. Y. Song College of Information Studies, Drexel University, Philadelphia, PA College of Information Studies, Drexel University, Philadelphia, PAView Profile , E. K. Park Dept. of Software Architecture, University of Missouri, Kansas City, MO Dept. of Software Architecture, University of Missouri, Kansas City, MOView Profile Authors Info & Claims CIKM '97: Proceedings of the sixth international conference on Information and knowledge managementJanuary 1997 Pages 201–208https://doi.org/10.1145/266714.266896Published:01 January 1997Publication History 2citation383DownloadsMetricsTotal Citations2Total Downloads383Last 12 Months4Last 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
Analysis and Design of Server Informative WWW-Sites
Authors: Amir M. Zarkesh, Jafar Adibi, Cyrus Shahabi, Reza Sadri, Vishal Shah
Venue: CIKM
Year: 1997

The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site&apos;s information. In this study, however, a systematic approach is introduced in order to analyze the users&apos; navigation paths to the advantage of the web-site owner. Briefly, as users navigate through a web-site, it seems that they are transparently filling a questionnaire designed a priori by the web-site owner. To achieve this, we first cluster the users who navigate similar paths employing the Path Mining algorithm. Next, the correlation between a set of target questions and the structure of the WWW-site is quantified. This has been done by borrowing the concept of channel from information theory. Finally, we compute the probability of a user&apos;s certain answer to each question, given the user&apos;s navigation path. The accuracy of the computed probabilities highly depends on the channel parameters. Hence, we describe a learning process based on a set of training data...
Static and Dynamic Information Organization with Star Clusters
Authors: Javed A. Aslam, Katya Pelekhov, Daniela Rus
Venue: CIKM
Year: 1998

In this paper we present a system for static and dynamic information organization and show our evaluations of this system on TREC data. We introduce the off-line and on-line star clustering algorithms for information organization. Our evaluation experiments show that the off-line star algorithm outperforms the single link and average link clustering algorithms. Since the star algorithm is also highly efficient and simple to implement, we advocate its use for tasks that require clustering, such as information organization, browsing, filtering, routing, topic tracking, and new topic detection.
An Iterative Approach for Rules and Data Allocation in Distributed Deductive Database Systems
Authors: Ladjel Bellatreche, Kamalakar Karlapalem, Qing Li
Venue: CIKM
Year: 1998

In a distributed deductive database system, queries which invoke rules executing at different sites and access different data need to be executed rather efficiently. Therefore, the rules invoked and relations accessed by the queries need to be allocated to sites so as to reduce the data transfer cost in processing a given set of queries. The rules and data allocation problem needs to take into consideration complex interdependencies among queries, rules and data. In this paper, we develop a comprehensive cost model for total data transfer incurred in processing a given set of queries by incorporating the dependencies among queries, rules and data. Furthermore, we develop an iterative approach to generate near-optimal solution for the combined rules and data allocation problem by using our cost model. In this approach, we start with an initial data allocation which is used for rule allocation, which in turn is used for data allocation, and so on. We stop this iterative rules and data allocation procedure when there is no further reduction in total data transfer cost incurred in processing the given set of queries. We also present the results of experiments conducted to evaluate the effectiveness of our approach by comparing the results with the exhaustive enumeration solution (which guarantees the optimal solution).
Memory-Adaptive Scheduling for Large Query Execution
Authors: Luc Bouganim, Olga Kapitskaia, Patrick Valduriez
Venue: CIKM
Year: 1998

Article Free Access Share on Memory-adaptive scheduling for large query execution Authors: Luc Bouganim PRiSM, Versailles, France PRiSM, Versailles, FranceView Profile , Olga Kapitskaia INRIA, Rocquencourt, France INRIA, Rocquencourt, FranceView Profile , Patrick Valduriez INRIA, Rocquencourt, France INRIA, Rocquencourt, FranceView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 105–115https://doi.org/10.1145/288627.288646Online:01 November 1998Publication History 13citation347DownloadsMetricsTotal Citations13Total Downloads347Last 12 Months9Last 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
Multi-Resolution Indexing for Shape Images
Authors: Tzi-cker Chiueh, Allen Ballman, Kevin Kreeger
Venue: CIKM
Year: 1998

1 Introduction Content-based image database retrieval fundamentally consists of two components: feature extraction, which abstracts high-level symbolic representations from pixellevel images, and fast searching, which employs intelligent indices to avoid exhaustive search and reduce the query response time. The Parallel Multimedia Index Server (PAMIS) project aims to build a general parallelizing index engine that can be tailored to specific media data types, such as image, speech, video, etc. Specifically, PAMIS supports an indexing mechanism for nearest-neighbor search for media objects whose distance metrics satisfy the triangular inequality. Almost all the media types we have considered have a representation whose distance metric satisfies the triangular inequality.
Providing Semantics for Indefinite Deductive Databases
Authors: Sei Chun, Jonghoon Chun
Venue: CIKM
Year: 1998

Article Free Access Share on Providing semantics for indefinite deductive databases Authors: Sei Chun Dept. of Computer Engineering, Myong Ji University, Yongin, Kyongki-Do, Korea 449-728 Dept. of Computer Engineering, Myong Ji University, Yongin, Kyongki-Do, Korea 449-728View Profile , Jonghoon Chun View Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 441–448https://doi.org/10.1145/288627.288694Online:01 November 1998Publication History 0citation187DownloadsMetricsTotal Citations0Total Downloads187Last 12 Months1Last 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
SERF: Schema Evalution through an Extensible, Re-usable and Flexible Framework
Authors: Kajal T. Claypool, Jing Jin, Elke A. Rundensteiner
Venue: CIKM
Year: 1998

Article SERF: schema evolution through an extensible, re-usable and flexible framework Share on Authors: Kajal T. Claypool Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA Department of Computer Science, Worcester Polytechnic Institute, Worcester, MAView Profile , Jing Jin Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA Department of Computer Science, Worcester Polytechnic Institute, Worcester, MAView Profile , Elke A. Rundensteiner Department of Computer Science, Worcester Polytechnic Institute, Worcester, MA Department of Computer Science, Worcester Polytechnic Institute, Worcester, MAView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 314–321https://doi.org/10.1145/288627.288672Online:01 November 1998Publication History 39citation359DownloadsMetricsTotal Citations39Total Downloads359Last 12 Months3Last 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 SiteGet Access
Locating Passages Using a Case-Based of Excerpts
Authors: Jody J. Daniels, Edwina L. Rissland
Venue: CIKM
Year: 1998

We present the SPIRE system, a hybrid case-based reasoning (CBR) and information retrieval (IR) system. It relies on a small case-base to seed the IR system to 1) select documents that are relevant to a presented problem case, and then (2) highlight within these retrieved documents passages that contain relevant information about specific case features. SPIRE aids not only problem-solving but knowledge acquisition by focusing a text extractor---person or program---on areas of text where needed information is likely to be found. Once extracted, this information can be used to create new cases or data-base objects thus closing the loop in the problem-solving---knowledge-acquisition cycle. 1 Introduction When confronted with a new problem, we frequently try to relate it to one that we have dealt with previously. If we have knowledge of a similar prior problem, we might try to apply the same or a related solution. Similarly, we might want to evaluate a scenario and hypothesize the likeli...
A Toggle Transaction Management Technique for Mobile Multidatabases
Authors: Ravi A. Dirckze, Le Gruenwald
Venue: CIKM
Year: 1998

Article A toggle transaction management technique for mobile multidatabases Share on Authors: Ravi A. Dirckze School of Computer Science, University of Oklahoma, Norman, Oklahoma 73019 School of Computer Science, University of Oklahoma, Norman, Oklahoma 73019View Profile , Le Gruenwald School of Computer Science, University of Oklahoma, Norman, Oklahoma 73019 School of Computer Science, University of Oklahoma, Norman, Oklahoma 73019View Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 371–377https://doi.org/10.1145/288627.288679Online:01 November 1998Publication History 15citation383DownloadsMetricsTotal Citations15Total Downloads383Last 12 Months2Last 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 SiteGet Access
An Analysis of the Structural Validity of Ternary Relatinships in Entity Relationship Modeling
Authors: James Dullea, Il-Yeol Song
Venue: CIKM
Year: 1998

____________________________________________________________________________________________________