OpenRaiser/Intern-Atlas huggingface dataset:
Fast Retrieval of Cursive Handwriting
Authors: Ibrahim Kamel
Venue: CIKM
Year: 1996

This paper presents an indexing method that can be used to search a large collection of cursive handwriting. The basic idea is to segment each cursive string into a set of strokes. Each of these strokes can be described with a set of features and, thus, can be stored as points in the feature space. The Karhuraen-Lor%e transform is then used to minimize the number of features used (data dimensionality) and thus the index size. Feature vectors are stored in an R-tree. Similarity search can be performed by executing a few range queries and then applying a simple voting algorithm to the output to select the strings that are most similar to the query. The proposed index can support similarity queries as well as substring mat thing. It is resilient to the kind of errors that result from the segmentation process, namely, stroke insertion/deletion and m-n substitution.
A New Conflict Relation for Concurrency Control and Recovery in object-based Databases
Authors: SangKeun Lee, Soon Young Jung, Chong-Sun Hwang
Venue: CIKM
Year: 1996

This paper proposes preservation as a new conflict relation in an object-based database. By explicitly including reverse-operations which bridge the gap between concurrency control and recovery, preservation can be used independently of execution contexts to which different recovery algorithms and/or object models give rise, and further it forms a basis for formulating semantics-based recovery. This paper also makes a t wo-dimensional( i.e., execution cent exts and operations’ specifications) comparison bet ween preservation and other conflict relations. Irr each execution cent ext, our formal comparison reveala that preservationbased concurrency control achieves more concurrency than commutativity-based one.
Distributed Processing of Time-Constrained Queries in CASE-DB
Authors: Sungkil Lee, Gultekin Özsoyoglu
Venue: CIKM
Year: 1996

We develop and experimentally evaluate a real-time distributed relational prototype database system that permits the specification of time constraints for relational algebra queries and evaluates queries in parallel over distributed sites in a completely replicated data environment.
Spatial Query Processing Using Object Decomposition Method
Authors: Yong-Ju Lee, Ho-Hyun Park, Nam-Hee Hong, Chin-Wan Chung
Venue: CIKM
Year: 1996

We propose a new object decomposition method, called DMBRs, to improve the performance of spatial query processing. This method is suitable for complex spatial objects in real-world geographic applications. The basic idea is that a polygon is recursively divided into two subpolygons by splitting its MBR until a given constraint is satisfied. To increase the efficiency of the DMBRs method, an extension of an existing spatial indexing structure is presented. Since this new structure can prune a number of false hits quickly, the performance of spatial query processing can be improved. The proposed method is compared with traditional decomposition methods by an analytical study. This comparison shows that our decomposition method outperforms the traditional decomposition methods. 1 Introduction Queries in spatial databases are usually concerned with massive volumes of data and complex spatial objects. Spatial objects are characterized by extremely irregular geometric components which do ...
Constructing Information Systems Based on Schema Reuse
Authors: Wen-Syan Li, Richard D. Holowczak
Venue: CIKM
Year: 1996

systems, which are based on database management systems, consist of two major parts: A alztabase schema and applications.
A Data Model for Supporting On-Line Analytical Processing
Authors: Chang Li, Xiaoyang Sean Wang
Venue: CIKM
Year: 1996

A database application, called &quot;on-line analytical processing&quot; (or OLAP) and aimed at providing business intelligence through on-line multidimensional data analysis, has become increasingly important due to the existence of huge amounts of on-line data. This paper formalizes a multidimensional data (MDD) model for OLAP, and develops an algebraic query language called grouping algebra. The basic component of the MDD model is a multidimensional cube, consisting of a number of relations (called dimensions) and for each combination of tuples (called a coordinate), one from each dimension, there is an associated data value. Each dimension is viewed as a basic grouping, i.e., each tuple in the dimension corresponds to the group consisting of all the coordinates that contain this tuple. In order to express user queries, relational algebra expressions are then extended to those on basic groupings for obtaining complex groupings, including orderoriented groupings (for expressing, e.g., cumula...
Processing OODB Queries by O-Algebra
Authors: Jie Lin, Z. Meral Özsoyoglu
Venue: CIKM
Year: 1996

O-Algebra is an object algebra designed for processing Object-Oriented Database (OODB) queries.
Indexing Values of Time Sequences
Authors: Ling Lin, Tore Risch, Martin Sköld, Dushan Z. Badal
Venue: CIKM
Year: 1996

A time sequence is a discrete sequence of vahtes, e.g. temperature measurements, varying over time. Conventional indexes for time sequences are built on the time domain and cannot derd with inverse queries on a time sequence (i.e. computing the times when the values satis~some conditions). To process an inverse query the entire time sequence has to be scanned. This paper presents a dynamic indexing technique on the vahte domain for large time sequences which can be implemented using regular ordered indexing techniques (e.g. B-trees). Our index (termed ZP-irtdex) dramatically improves the query processing time of inverse queries compared to linear scanning. For periodic time sequences that have a limited range and precision on their value domain (most time sequences have this property), the W-index has an upper bound for insertion time and search time.
Modeling a Vocabulary in an Object-Oriented Database
Authors: Li-min Liu, Michael Halper, Huanying Gu, James Geller, Yehoshua Perl
Venue: CIKM
Year: 1996

Controlled vocabularies have been used as the means for unifying disparate terminologies found within an application field. This unification leads to better administration of information and enhanced communication among various parties. Semantic networks have been shown to be excellent vehicles for modeling controlled vocabularies. However, they often lack the necessary access flexibility and robustness required by external agents such as intelligent information-locators and decision-support systems. In this paper, we describe the process of mapping an existing medical vocabulary based on a semantic network model into an Object-Oriented Database (OODB) system. We first consider two straightforward approaches to carrying out this task and describe their deficiencies. We then present a new approach which yields a very compact OODB schema for the representation of the vocabulary&apos;s entire hierarchy and inter-connectivity. We refer to the resulting OODB as the Object-Oriented Healthcare Voc...
Performance Evaluation of G-tree and Its Application in Fuzzy Databases
Authors: Chengwen Liu, Aris M. Ouksel, A. Prasad Sistla, Jing Wu, Clement T. Yu, Naphtali Rishe
Venue: CIKM
Year: 1996

Article Free Access Share on Performance evaluation of G-tree and its application in fuzzy databases Authors: Chengwen Liu DePaul University, Chicago, Illinois DePaul University, Chicago, IllinoisView Profile , Aris Ouksel University of Illinois at Chicago University of Illinois at ChicagoView Profile , Prasad Sistla University of Illinois at Chicago University of Illinois at ChicagoView Profile , Jing Wu University of Illinois at Chicago University of Illinois at ChicagoView Profile , Clement Yu University of Illinois at Chicago University of Illinois at ChicagoView Profile , Naphtali Rishe Florida International University Florida International UniversityView Profile Authors Info & Claims CIKM '96: Proceedings of the fifth international conference on Information and knowledge managementNovember 1996 Pages 235–242https://doi.org/10.1145/238355.238503Published:12 November 1996Publication History 11citation347DownloadsMetricsTotal Citations11Total Downloads347Last 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 SiteeReaderPDF
Integrating Constraints in Complex Objects
Authors: Chabane Oussalah, Veronique Puig
Venue: CIKM
Year: 1996

This paper presents the CHIC (Constraints in Hierarchical Composite objects) model for expressing and maintaining constraints between objects in a part-whole hierarchy. This model is based essentially on the semantics of the part-whole relation both in representing and managing constraints. Its principal contribution involves integrating an explicit object-oriented constraint model in complex objects with contextual reactivity. 1
Dynamic Query Optimization on a Distributed Object Management Platform
Authors: Fatma Ozcan, Sena Nural, Pinar Koksal, Cem Evrendilek, Asuman Dogac
Venue: CIKM
Year: 1996

Object Management (DOM) architecture, when used as the infrastructure of a multidatabase system, not only enables easy and flexible interoperation of D13MSS, but also facilitates interoperation of the multidatabase system with other repositories that do not have DIBMS capabilities.
Recursive Query Processing Using Graph Traversal Techniques
Authors: Estrella Pulido
Venue: CIKM
Year: 1996

This paper presents STARBASE, n new algorithm for recursive querypmcessittgondeductivedatabasesbaaedon the Chart Parsing algorithm.
S-signature: A New Scheme for Efficient Query Processing of Complex Objects in OODB
Authors: Hakgene Shin, KangSeuk Kim, Jae-Woo Chang
Venue: CIKM
Year: 1996

Due to the wide acceptance of object-oriented database systems, some implementation issues such as query processing and indexing become a crucial factor in the success of object-oriented database systems. To tackle the issues, we propose an s-signature scheme, which is an efficient access method for query processing, especially, when the path dictionary is used. We also compare the s-signature scheme with other indexing techniques such as path index, path signature, and path dictionary. Finally, we demonstrate that the proposed method shows significant improvements in the retrieval operation, while at the same time producing lower storage overhead than the path index.
Incorporating Latent Semantic Indexing into a Neural Network Model for Information Retrieval
Authors: Inien Syu, Sheau-Dong Lang, Narsingh Deo
Venue: CIKM
Year: 1996

We incorporate the Latent Semantic Indexing (LSl) technique into a competition-based neural network model for information retrieval. The original neural network model was based on a causal inference network, incorporating Roget's Thesaurus, that connects the index terms and related documents. Since the pmcIess of creating or updating a thesaurus is rather expensive, we apply the LSI technique to provide an automated procedure that captures the semantic relationship between the doctrments and index terms. C)ur experimental results using four standard text collections show that the LSI-baaed model generates appreciable improvement in retrieval effectiveness with faster query evaluation over the thesatrrus-ba~sed model.
Handling Uncertainties in Workflow Applications
Authors: Jian Tang, San-Yih Hwang
Venue: CIKM
Year: 1996

Workflow techniques are currently seen as the key techniques to improve the effectiveness and productivity of business processes. Most workflow models take a static view toward workflow applications.
A Case Study of Venus and a Declarative Basis for Rule Modules
Authors: Lane Warshaw, Daniel P. Miranker
Venue: CIKM
Year: 1996

Article A case study of Venus and a declarative basis for rule modules Share on Authors: Lane B. Warshaw Department of Computer Sciences and Applied Research Laboratories, The University of Texas at Austin Department of Computer Sciences and Applied Research Laboratories, The University of Texas at AustinView Profile , Daniel P. Miranker Department of Computer Sciences and Applied Research Laboratories, The University of Texas at Austin Department of Computer Sciences and Applied Research Laboratories, The University of Texas at AustinView Profile Authors Info & Claims CIKM '96: Proceedings of the fifth international conference on Information and knowledge managementNovember 1996 Pages 317–325https://doi.org/10.1145/238355.238569Published:12 November 1996 4citation284DownloadsMetricsTotal Citations4Total Downloads284Last 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 SiteGet Access
Efficient Retrieval for Browsing Large Image Databases
Authors: Daniel Wu, Divyakant Agrawal, Amr El Abbadi, Ambuj K. Singh, Terence R. Smith
Venue: CIKM
Year: 1996

The Alexandria project has been initiated to build a digital library for map and satellite images. Designed for content-based retrieval, the relevant information in each image is encoded in the form of a multi-dimensional feature vector. Though representing images by feature vectors ~eatly facilitates user queries, indexing these vectors degrades performance when the number of dimensions is large. We consider 2 popular techniques (DFT and SVD) to reduce the dimension of feature vectors, and study their retrieval performance with respect to recall and precision. We End that though SVD generally out-performs DFT, DFT compares favorably in a limited range suitable for browsing large image databases.
Towards Maintaining Consistency of Spatial Databases
Authors: Alia I. Abdelmoty, Christopher B. Jones
Venue: CIKM
Year: 1997

This paper focuses on the consistency issues related to integrating multiple sets of spatial data in spatial information systems such as Geographic Information Systems (GISs). Data sets to be integrated are assumed to hold information about the same geographic features which can be drawn from different sources at different times, which may vary in reliability and accuracy, and which may vary in the scale of presentation resulting in possible multiple spatial representations for these features. A systematic approach is proposed which relies first on breaking down the consistency issue by identifying a range of consistency classes which can be checked in isolation. These classes are a representative set of properties and relationships which can completely identify the geographic objects in the data sets. Different levels of consistency are then proposed, namely, total, partial and conditional, which can be checked for every consistency class. This provides the flexibility for two data sets to be integrated without necessarily being totally consistent in every aspect. The second step of the proposed approach is to explicitly represent the different classes and levels of consistency in the system. As an example, a simple structure which stores adjacency relationships is given which can be used for the explicit representation of topological consistency. The paper also proposes that the set of consistent knowledge in the data sets (which is mostly qualitative) be explicitly represented in the database and that uncertainty or ambiguity inherent in the knowledge be represented as well.
On Disk Caching of Web Objects in Proxy Servers
Authors: Charu C. Aggarwal, Philip S. Yu
Venue: CIKM
Year: 1997

Article On disk caching of Web objects in proxy servers Share on Authors: Charu G. Aggarwal IBM T.J. Watson Research Center, Yorktown Heights, NY IBM T.J. Watson Research Center, Yorktown Heights, NYView Profile , Philip S. Yu IBM T.J. Watson Research Center, Yorktown Heights, NY IBM T.J. Watson Research Center, Yorktown Heights, NYView Profile Authors Info & Claims CIKM '97: Proceedings of the sixth international conference on Information and knowledge managementJanuary 1997 Pages 238–245https://doi.org/10.1145/266714.266904Online:01 January 1997Publication History 11citation418DownloadsMetricsTotal Citations11Total Downloads418Last 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 SiteGet Access
Block Addressing Indices for Approximate Text Retrieval
Authors: Ricardo A. Baeza-Yates, Gonzalo Navarro
Venue: CIKM
Year: 1997

Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, the indices may point to text blocks instead of exact word positions. This is called &quot;block addressing&quot;. The most notorious index of this kind is Glimpse. However, block addressing has not been well studied yet, especially regarding approximate searching. Our main contribution is an analytical study of the spacetime trade-offs related to the block size. We find that, under reasonable assumptions, it is possible to build an index which is simultaneously sublinear in space overhead and in query time. We validate the analysis with extensive experiments, obtaining typical performance figures. These results are valid not only for approximate searching queries but also for classical ones. Finally, we propose a new strategy for approximate searching on block addressing indices, which we experimentally find 4-5 times f...
The AudioWeb
Authors: Daniel Barbará, Shamim A. Naqvi
Venue: CIKM
Year: 1997

This paper describes the idea of a wide area information system based entirely on audio information (Audioweb). We address two issues. First, we address the issue of adding hyperaudio links to audio documents non-intrusively (Le., without the need to modify the audio track). By doing so, audio documents can be linked together to form the AudioWeb. Secondly, we show how, based on the audio format discussed previously, a series of interfaces (browsers), that enable the user to navigate a web of audio documents, can be implemented. 1
Matching and Indexing Sequences of Different Lengths
Authors: Tolga Bozkaya, Nasser Yazdani, Z. Meral Özsoyoglu
Venue: CIKM
Year: 1997

In this paper, we consider the problem of efficient matching and retrieval of sequences of different lengths. Most of the previous research is concentrated on similarity matching and retrieval of sequences of the same length using Euclidean distance metric. For similarity matching of sequences, we use a modified version of the edit distance function, and consider two sequences matching if a majority of the elements in the sequences match. In the matching process a mapping among non-matching elements is created to check if there are unacceptable deviations among them. This means that two matching sequences should have lengths that are comparable. For efficient retrieval of matching sequences, we propose an indexing scheme which is totally based on lengths and relative distances between sequences. We use vp-trees as the underlying distance-based index structures in our method. 1 Introduction The problem of matching sequences with respect to a similarity measure is encountered in a varie...
Xmas: An Extensible Main-Memory Storage System
Authors: Sang Kyun Cha, Jang Ho Park, Byoung Dae Park
Venue: CIKM
Year: 1997

This paper presents the architecture of Xmas, an extensible mainmemory storage system for high-performance and real-time database applications. Xmas not only provides the core functionality of a DBMS, such as data persistence, concurrency control, and crash recovery, but aIso has an extensible architecture to deal with requirements from various applications. One crucial aspect of such extensibility is that an application developer can compose applicationspecific, high-level operations with a basic set of operations provided by the system. CalIed composite actions in Xmas, these operations are processed by a customized Xmar server with minimum interaction with application processes, thus increasing the overall performance.
Mining Fuzzy Association Rules
Authors: Keith C. C. Chan, Wai-Ho Au
Venue: CIKM
Year: 1997

In this paper, we introduce a novel technique, called F-APACS, for mining fuzzy association rules. Existing algorithms involve discretizing the domains of quantitative attributes into intervals so as to discover quantitative association rules. These intervals may not be concise and meaningful enough for human experts to easily obtain nontrivial knowledge from those rules discovered. Instead of using intervals, F-APACS employs linguistic terms to represent the revealed regularities and exceptions. The linguistic representation is especially useful when those rules discovered are presented to human experts for examination. The definition of linguistic terms is based on fuzzy set theory and hence we call the rules having these terms fuzzy association rules. The use of fuzzy techniques makes F-APACS resilient to noises such as inaccuracies in physical measurements of real-life entities and missing values in the databases. Furthermore, F-APACS employs adjusted difference analysis which has the advantage that it does not require any user-supplied thresholds which are often hard to determine. The fact that F-APACS is able to mine fuzzy association rules which utilize linguistic representation and that it uses an objective yet meaningful confidence measure to determine the interestingness of a rule makes it very effective at the discovery of rules from a real-life transactional database of a PBX system provided by a telecommunication corporation.
A Spatial Match Representation Scheme for Indexing and Querying in Iconic Image Databases
Authors: Jae-Woo Chang, Yeon-Jung Kim, Ki-Jin Chang
Venue: CIKM
Year: 1997

In multimedia information retrieval applications, contentbased image retrieval is essential for retrieving relevant mnltimedia documents. The purpose of our paper is to provide both effective representation and efficient retrieval of images when a pixel-level original image is antomaticahy or mannally transformed into its iconic image containing meaningful graphic descriptions, called icon objects. For this, we propose a new spatial match representation scheme to describe spatial relationships between icon objects preciseIy by using accurate positional operators as well as by expressing objects as rectangles, rather than pointer. In order to accelerate image searching, we also design an efficient retrieval method using a signature file technique. Finally, we show from our experiments that our representation scheme achieves better retrieval effectiveness than the 9-DLT scheme.