OpenRaiser/Intern-Atlas huggingface dataset:
On the Update of Term Weights in Dynamic Information Retrieval Systems
Authors: Charles L. Viles, James C. French
Venue: CIKM
Year: 1995

Using the vector space information retrieval model, we show that the update of term weights under document insertions is computationally expensive for weighting schemes that use collection statistics and normalization by document vector lengths. In the dynamic setting, we argue that strict adherence to such schemes is impractical and unnecessary as long as retrieval effectiveness commensurate with strict adherence is attained. Experiments using standard test collections as a source of document insertions support this argument. These experiments indicate that term weights may drift from their mathematically defined values without a serious loss of retrieval effectiveness. The only problematic setting is when new terms are present in newly inserted documents. Ignoring these terms can cause an effectiveness degradation. 1 Introduction The rapid growth in online information has fueled recent interest in techniques to handle the burgeoning flood of data becoming electronically available. ...
SortTables: A Browser for a Digital Library
Authors: William C. Wake, Edward A. Fox
Venue: CIKM
Year: 1995

retrieval haafocused more on matching results to queries than on browsing those restdts. After briefly exploring browsing in physical and electronic libraries, we introduce SortTables, a new system that focuses on support for browsing.
Algebraic Query Languages on Temporal Databases with Multiple Time Granularities
Authors: Xiaoyang Sean Wang
Venue: CIKM
Year: 1995

This paper investigates algebraic query languages on temporal databases. The data model used is a multidimensional extension of the temporal modules introduced in [WJS95]. In a multidimensional temporal module, every non-temporal fact has a timestamp that is a set ofn-ary tuples of time points. A temporal module has a set of timestamped facts and has an associated temporal granularity (or temporal type), and a temporal database is a set of multidimensional temporal modules with possibly different temporal types. Temporal algebras are proposed on this database model. Example queries and results of the paper show that the algebras are rather expressive. The operations of the algebras are organized into two groups: snapshot-wise operations and timestamp operations. Snapshot-wise operations are extensions of the traditional relational algebra operations, while timestamp operations are extensions of first-order mappings from timestamps to timestamps. Multiple temporal types are only dealt with by these timestamp operations. Hierarchies of algebras are defined in terms of the dimensions of the temporal modules in the is used to denote all the algebra queries whose input, output and intermediate modules are of dimensions at mostm,nandk, respectively. (Most temporal algebras proposed intermediate results. The symbol TALG m;n k in the literature are in TALG 1;1 1.) Equivalent hierarchies TCALCm;n k are defined in a calculus query language that is formulated by using a first-order logic with linear order. The addition of aggregation functions into the algebras is also studied.
Long-Duration Transaction Support in Design Databases
Authors: Waldemar Wieczerzycki
Venue: CIKM
Year: 1995

In the paper new functionalities for design databases are proposed which are necessary to improve a cooperative work of design team members. These functionalities mainly concern versioning aspects of design environments. First, new versioning technique, called delayed versionning, is proposed. This technique supports designers working in shared environments. It substantially increases a concurrency degree of designers transactions. Next, a new versioning concept, called temporary database version, is introduced. Its purpose is to isolate long-duration read-only transactions from other transactions, in order to maximize the system efficiency. Afterwards, a new technique for transactions savepoints management is proposed. It supports long-duration transactions which are often rolled back to particular points of corresponding design activities, due to unsatisfactory directions of the design evolution. Finally, a solution for useless design environments removaf is proposed. All the functionalities mentioned above are currently implemented in the multiversion database prototype. 1 introduction Computer aided design (CA D) is an interactive group process in which the progress is reached step-by-step by creat]on of improved versions of the product designed. Each stage of this process requmes sharing and exchanging information among members of the group, that consists in importing and exporting temporary and final versions of product components among different computer sites of the federated environment. After many iterations go-ahead or rofl-back, a final version of the product is developed, which may be released to manufacturers. Recently CAD applications are built around object-oriented databasse systems ( OODBs) which combine features of object-oriented languages and traditional databases. CAD applications require, on one hand, complex data structures to represent schemas, pictures, photos, graphs, sounds etc., as well as modeling mechanisms which may be used to express complex relationships between data. Hopefully, these mecha-Parmmmn to make digitallhard c ies of all or part of this rneteriel thr
A Configurable Approach for Object Sharing Among Multidatabase Systems
Authors: Jian Yang, Mike P. Papazoglou
Venue: CIKM
Year: 1995

Article Free Access Share on A configurable approach for object sharing among multidatabase systems Authors: Jian Yang Dept of Computer Science, University College, UNSW Australian Defence Force Academy, Canberra ACT 2600, Australia Dept of Computer Science, University College, UNSW Australian Defence Force Academy, Canberra ACT 2600, AustraliaView Profile , Mike P. Papazoglou School of Information Systems, Faculty of Information Technology, Queensland University of Technology, Brisbane QLD 4001, Australia School of Information Systems, Faculty of Information Technology, Queensland University of Technology, Brisbane QLD 4001, AustraliaView Profile Authors Info & Claims CIKM '95: Proceedings of the fourth international conference on Information and knowledge managementDecember 1995 Pages 129–136https://doi.org/10.1145/221270.221358Online:02 December 1995Publication History 1citation82DownloadsMetricsTotal Citations1Total Downloads82Last 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
Semantic Query Processing in Object-Oriented Databases Using Deductive Approach
Authors: Suk-Chung Yoon, Il-Yeol Song, E. K. Park
Venue: CIKM
Year: 1995

Article Semantic query processing in object-oriented databases using deductive approach Share on 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 Computer Science, U.S. Naval Academy, Annapolis, MD Dept. of Computer Science, U.S. Naval Academy, Annapolis, MDView Profile Authors Info & Claims CIKM '95: Proceedings of the fourth international conference on Information and knowledge managementDecember 1995 Pages 150–157https://doi.org/10.1145/221270.221365Online:02 December 1995Publication History 12citation445DownloadsMetricsTotal Citations12Total Downloads445Last 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 SiteGet Access
A Terrain Database Representation Based on an Extended Vector Product Format
Authors: Mahdi Abdelguerfi, Edgar Cooper, Christ Wynne, Kevin Shaw, Vincent Miller, Robert Broome, Barbara Ray
Venue: CIKM
Year: 1996

Recent studies have shown that the Vector Product Format (VPF) and most VPF-based products no longer meet the needs of the Modeling and Simulation (M&S) community of the Army, Navy, and Marine Corps. The research presented in this paper addresses some of the deficiencies outlined in these requirement surveys. One of the goals of this research is an Extended Vector Product Fortnat (EVPF) and an EVPF-based product "Modeling and Simulation Extended Vector Product (MSEVP)." EVPF, which remains within the confines of VPF'S static georelational data strttcture, extends VPF to allow for the efficient storage and access of Triangulated Irregular Network (TIN)-based three dimensional elevation data. Additionally, EVPF permits the efficient integration of terrain elevation data with ground surface features, and provides an elegant method of rendering terrain in three-dimensions. This paper documents the design of EVPF and highlights its salient features. It also reports on our progress toward the design and implementation of an MSEVP prototype. MSEVP is expected to better serve the needs of the M&S community by addressing some of the deficiencies outlined in recent requirement studies.
On Implementing SchemaLog - A Database Programming Language
Authors: Alanoly Andrews, Nematollaah Shiri, Laks V. S. Lakshmanan, Iyer N. Subramanian
Venue: CIKM
Year: 1996

Article On implementing SchemaLog—a database programming language Share on Authors: Alanoly J. Andrews Concordia University, Montreal, Canada Concordia University, Montreal, CanadaView Profile , Nematollaah Shiri Concordia University, Montreal, Canada Concordia University, Montreal, CanadaView Profile , Laks V. S. Lakshmanan Concordia University, Montreal, Canada Concordia University, Montreal, CanadaView Profile , Iyer N. Subramanian Concordia University, Montreal, Canada Concordia University, Montreal, CanadaView Profile Authors Info & Claims CIKM '96: Proceedings of the fifth international conference on Information and knowledge managementNovember 1996 Pages 309–316https://doi.org/10.1145/238355.238565Online:12 November 1996Publication History 4citation247DownloadsMetricsTotal Citations4Total Downloads247Last 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 AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Processing Queries for First Few Answers
Authors: Roberto J. Bayardo Jr., Daniel P. Miranker
Venue: CIKM
Year: 1996

Special support for quickly finding the first-few answers of a query is atready appearing in commercial database systems. This support is useful in active databases,when dealing with potentially unmanageable query results, and as a declarative akernativeto navigational techniques. In this paper, wediscuss query processing techniques for first-answer queries. We provide a method for predicting the cost of a first-answer query plan under an execution model that attempts to reduce wasted effort in join pipelining. We define new statistics necessary for accurate cost prediction, and discuss techniques for obtaining the statistics through traditional statistical measures (e.g. selectivity) and semantic data properties commonly specified through modem 00DB and relatiorud schemas. The proposed techniques also apply to all-answer query processing when optimizing for fast delivery of the initiat query results.
Information Agents for Automated Browsing
Authors: Chanda Dharap, Martin Freeman
Venue: CIKM
Year: 1996

Article Free Access Share on Information agents for automated browsing Authors: Chanda Dharap Philips Research Labs. Philips Research Labs.View Profile , Martin Freeman Philips Research Labs. Philips Research Labs.View Profile Authors Info & Claims CIKM '96: Proceedings of the fifth international conference on Information and knowledge managementNovember 1996 Pages 296–305https://doi.org/10.1145/238355.238563Published:12 November 1996Publication History 10citation496DownloadsMetricsTotal Citations10Total Downloads496Last 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 SiteeReaderPDF
The Personal Electronic Program Guide - Towards the Pre-Selection of Individual TV Programs
Authors: Michael Ehrmanntraut, Theo Härder, Hartmut Wittig, Ralf Steinmetz
Venue: CIKM
Year: 1996

Digital and interactive TV systems will bring hundreds of TV program channels to the people. Then, the use of existing strategies for channel selection will fail: It is neither possible to select the program by "sur@g" through the channels, nor by using printed program guides.
An Object-Oriented Approach to Multi-Level Association Rule Mining
Authors: Scott Fortin, Ling Liu
Venue: CIKM
Year: 1996

Article Free Access Share on An object-oriented approach to multi-level association rule mining Authors: Scott Fortin University of Alberta University of AlbertaView Profile , Ling Liu University of Alberta University of AlbertaView Profile Authors Info & Claims CIKM '96: Proceedings of the fifth international conference on Information and knowledge managementNovember 1996 Pages 65–72https://doi.org/10.1145/238355.238437Online:12 November 1996Publication History 12citation914DownloadsMetricsTotal Citations12Total Downloads914Last 12 Months14Last 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
Object-Oriented and Database Concepts for the Design of Networked Information Retrieval Systems
Authors: Norbert Fuhr
Venue: CIKM
Year: 1996

By using data abstraction concepts from database and objectoriented systems and combining them with uncertain inference, we develop a new approach for the design of information retrieval (IR) systems, thus solving major problems with regard to networked IR. Different data types with vague predicates are required to allow for queries referring to arbitrary attributes of documents. Physical data independence helps in solving text search problems related to noun phrases, compound words and proper nouns. Logical data independence allows for different views on an IR database, thus implementing e.g. data security. Inheritance, especially on attributes, supports the creation of unified views on a set of IR databases. Uncertain inference allows for query processing even on incompatible database schemas. 1 Introduction Due to the rapid growth of the Internet, the development of powerful search tools is becoming a crucial issue for effective use of the sources that are available on the network....
Infomod: A Knowledge-Based Moderator for Electronic Mail Help Lists
Authors: Robert J. Hall
Venue: CIKM
Year: 1996

Focused informational electronic mail lists, where end users as well as help staff members read and respond to messages, enable the users of a product or service to get timely answers to questions, while requiring fewer paid staff-hours than customer help desks. However, such lists can be plagued by (a) knowledge loss through user and staff turnover and absences, (b) frequently-asked or RTFM questions, and (c) misdirected administrative messages. This paper describes an approach to building a knowledge-based automated list moderator that partially solves these problems, filtering list traffic so that users with frequently asked or administrative questions can get answers without bothering the rest of the list members. INFO MOD employs an expandable base of question-answering knowledge about the product or service, providing tools to help maintain the knowledge.
Background for Association Rules and Cost Estimate of Selected Mining Algorithms
Authors: Jia Liang Han, Ashley W. Plank
Venue: CIKM
Year: 1996

Article Background for association rules and cost estimate of selected mining algorithms Share on Authors: Jia Liang Han University of Southern, Queensland University of Southern, QueenslandView Profile , Ashley W. Plank University of Southern, Queensland University of Southern, QueenslandView Profile Authors Info & Claims CIKM '96: Proceedings of the fifth international conference on Information and knowledge managementNovember 1996 Pages 73–80https://doi.org/10.1145/238355.238440Online:12 November 1996Publication History 14citation307DownloadsMetricsTotal Citations14Total Downloads307Last 12 Months4Last 6 weeks2 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
Adapting a Spatial Access Structure for Document Representations in Vector Space
Authors: Andreas Henrich
Venue: CIKM
Year: 1996

Article Free Access Share on Adapting a spatial access structure for document representations in vector space Author: Andreas Henrich Universität Siegen, Praktische Informatik, D-57068 Siegen, Germany Universität Siegen, Praktische Informatik, D-57068 Siegen, GermanyView Profile Authors Info & Claims CIKM '96: Proceedings of the fifth international conference on Information and knowledge managementNovember 1996 Pages 19–26https://doi.org/10.1145/238355.238367Online:12 November 1996Publication History 8citation342DownloadsMetricsTotal Citations8Total Downloads342Last 12 Months5Last 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
Effective Graph Clustering for Path Queries in Digital Map Databases
Authors: Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner
Venue: CIKM
Year: 1996

In this paper, we present an experimental evaluation of graph clustering strategies in terms of their effectiveness in optimizing I/O for path query processing in digital map databases. Clustering optimization is attractive because it does not incurs any run-time cost, and is complimentary to many of the existing techniques in path query optimization. We first propose a novel graph clustering technique, called Spatial Partition Clustering (SPC), that creates balanced partitions of links based on the spatial proximity of their origin nodes. We then select three alternative clustering techniques from the literature, namely two-way partitioning, approximately topological clustering, and random clustering, to compare their performance in path query processing with SPC. Experimental evahration indicates
Learning to Extract Information From Text Based on User-Provided Examples
Authors: Scott B. Huffman
Venue: CIKM
Year: 1996

A growing population of users want to extract a growing variety of information from on-line texts. Unfortunately, current information extraction systems typically require experts to hand-build dictionaries of extraction patterns for each new type of information to be extracted. This paper presents a system that can learn dictionaries of extraction patterns directly from user-provided examples of texts and events to be extracted from them. Thes ystem, called LIEP, learns patterns that recognize relationships between key constituents based on local syntax. Patterns take the form of paths through a finite-state machine. Se&of patterns learned by LIEP for a sample extraction task perform nearly at the level of a hand-built dictionary of patterns.
Notes Explorer: Entity-Based Retrieval in Shared, Semi-Structured Information Spaces
Authors: Scott B. Huffman, Catherine Baudin
Venue: CIKM
Year: 1996

Article Notes Explorer: entity-based retrieval in shared, semi-structured information spaces Share on Authors: Scott Huffman Price Waterhouse Technology Centre Price Waterhouse Technology CentreView Profile , Catherine Baudin Price Waterhouse Technology Centre Price Waterhouse Technology CentreView Profile Authors Info & Claims CIKM '96: Proceedings of the fifth international conference on Information and knowledge managementNovember 1996 Pages 99–106https://doi.org/10.1145/238355.238452Online:12 November 1996Publication History 2citation295DownloadsMetricsTotal Citations2Total Downloads295Last 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
Hierarchical Optimization of Optimal Path Finding for Transportation Applications
Authors: Ning Jing, Yun-Wu Huang, Elke A. Rundensteiner
Venue: CIKM
Year: 1996

Efficient path query processing is a key requirement for advanced database applications including GIS (Geographic Information Systems) and ITS (Intelligent Transportation Systems). We study the problem in the context of automobile navigation systems where a large number of path requests can be submitted over the tmrtsportation network within a short period of time. To guarantee efficient responsefor path queries, we employ a path view materiatization strategy for precomputing the best paths. We tackle the following three issues: (1) memory-resident solutions quickly exceed cr.nrentcomputer storage capacity for networks of thousands of nodes, (2) diskbased solutions have been found inefficient to meet the stringent performance requirements, and (3) path views become too costly to update for large graphs. We propose the HEPV (Hierarchical Encoded Path View) approach that addressesthese problems while guaranteeing the optimality of path retrieval. Our experimental fesuks reveaf that HEPV is more efficient than previously known path finding approaches.