OpenRaiser/Intern-Atlas huggingface dataset:
Handling Temporal Grouping and Pattern-Matching Queries in a Temporal Object Model
Authors: Marlon Dumas, Marie-Christine Fauvet, Pierre-Claude Scholl
Venue: CIKM
Year: 1998

This paper presents a language for expressing temporal pattern-matching queries, and a set of temporal grouping operators for structuring histories following calendar-based criteria. Pattern-matching queries are shown to be useful for reasoning about successive events in time while temporal grouping may be either used to aggregate data along the time dimension or to display histories. The combination of these capabilities allows to express complex queries involving succession in time and calendar-based conditions simultaneously. These operators are embedded into the TEMPOS temporal data model and their use is illustrated through examples taken from a geographical application. The proposal has been validated by a prototype on top of the O 2 DBMS. Keywords: temporal databases, temporal object model, temporal query language, pattern-matching queries, temporal grouping, calendar, granularity, O 2 . 1 Introduction In most modern DBMS, time is one of the primitive datatypes provided for d...
Framboise - An Approach to Framework-Based Active Database Management System Construction
Authors: Hans Fritschi, Stella Gatziu, Klaus R. Dittrich
Venue: CIKM
Year: 1998

Article Free Access Share on FRAMBOISE—an approach to framework-based active database management system construction Authors: Hans Fritschi Database Technology Reaearch Group, Institut für Informatik, Universität Universität Zürich Database Technology Reaearch Group, Institut für Informatik, Universität Universität ZürichView Profile , Stella Gatziu Database Technology Reaearch Group, Institut für Informatik, Universität Universität Zürich Database Technology Reaearch Group, Institut für Informatik, Universität Universität ZürichView Profile , Klaus R. Dittrich Database Technology Reaearch Group, Institut für Informatik, Universität Universität Zürich Database Technology Reaearch Group, Institut für Informatik, Universität Universität ZürichView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 364–370https://doi.org/10.1145/288627.288678Online:01 November 1998Publication History 11citation283DownloadsMetricsTotal Citations11Total Downloads283Last 12 Months13Last 6 weeks7 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
Temporal Granularity for Unanchored Temporal Data
Authors: Iqbal A. Goralwalla, Yuri Leontiev, M. Tamer Özsu, Duane Szafron, Carlo Combi
Venue: CIKM
Year: 1998

Granularity is an integral feature of both anchored (e.g., 25 October 1995, July 1996) and unanchored (e.g., 3 minutes, 6 hours 20 minutes, 5 days, 1 week) temporal data. In supporting temporal data that is specified in different granularities, numerous approaches have been proposed to deal with the issues of converting temporal data from one granularity to another. The emphasis, however, has only been on granularity conversions with respect to anchored temporal data. This is because a granularity in these approaches is modeled as an anchored partitioning of the time axis, thereby making it difficult to deal with granularity conversions in unanchored temporal data. In this paper we provide a novel approach to the treatment of granularity in temporal data. A granularity is modeled as a special kind of unanchored temporal primitive that can be used as a unit of time. That is, a granularity is modeled as a unit unanchored temporal primitive. Granularities are accommodated within the cont...
Dynamic Skew Handling in Parallel Mining of Association Rules
Authors: Lilian Harada, Naoki Akaboshi, Kazutaka Ogihara, Riichiro Take
Venue: CIKM
Year: 1998

Article Dynamic skew handling in parallel mining of association rules Share on Authors: Lilian Harada Software Laboratory, Fujitsu Laboratories Ltd. Software Laboratory, Fujitsu Laboratories Ltd.View Profile , Naoki Akaboshi Software Laboratory, Fujitsu Laboratories Ltd. Software Laboratory, Fujitsu Laboratories Ltd.View Profile , Kazutaka Ogihara Software Laboratory, Fujitsu Laboratories Ltd. Software Laboratory, Fujitsu Laboratories Ltd.View Profile , Riichiro Take Software Laboratory, Fujitsu Laboratories Ltd. Software Laboratory, Fujitsu Laboratories Ltd.View Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 76–85https://doi.org/10.1145/288627.288634Published:01 November 1998 1citation276DownloadsMetricsTotal Citations1Total Downloads276Last 12 Months1Last 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
Learning Fuzzy Knowledge from Training Examples
Authors: Tzung-Pei Hong, Chai-Ying Lee
Venue: CIKM
Year: 1998

Article Free Access Share on Learning fuzzy knowledge from training examples Authors: Tzung-Pei Hong Department of Information Management, I-Show University, kaohsiung, 84008, Taiwan, R.O.C Department of Information Management, I-Show University, kaohsiung, 84008, Taiwan, R.O.CView Profile , Chai-Ying Lee Industrial Technology Research Institute, Chutung, hsinchu, Taiwan 310, R.O.C Industrial Technology Research Institute, Chutung, hsinchu, Taiwan 310, R.O.CView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998Pages 161–166https://doi.org/10.1145/288627.288653Published:01 November 1998Publication History 7citation751DownloadsMetricsTotal Citations7Total Downloads751Last 12 Months33Last 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
Continual Computation Policies for Utility-Directed Prefetching
Authors: Eric Horvitz
Venue: CIKM
Year: 1998

Article Free Access Share on Continual computation policies for utility-directed prefetching Author: Eric Horvitz Microsoft Research, One Microsoft way, Redmond, WA Microsoft Research, One Microsoft way, Redmond, WAView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998Pages 175–184https://doi.org/10.1145/288627.288655Published:01 November 1998Publication History 16citation275DownloadsMetricsTotal Citations16Total Downloads275Last 12 Months7Last 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
Efficient Repeating Pattern Finding in Music Databases
Authors: Jia-Lien Hsu, Arbee L. P. Chen
Venue: CIKM
Year: 1998

In this paper, we propose an approach for the extraction of the repeating patterns in music objects. A repeating pattern is a sequence of notes which appears more than once in a music object. It is one of the most important music features which can be used for both content-based retrieval of music data and music data analysis. We propose a data structure called correlative matrix and its associated algorithms for extracting all repeating patterns in a music object. Experiments are also performed and the results are analyzed to show the efficiency and the effectiveness of our approach.
Information Extraction from Case Low and Retrieval of Prior Cases by Partial Parsing and Query Generation
Authors: Peter Jackson, Khalid Al-Kofahi, Chris Kreilick, Brian Grom
Venue: CIKM
Year: 1998

Article Free Access Share on Information extraction from case law and retrieval of prior cases by partial parsing and query generation Authors: Peter Jackson Computer Science Research Department, West Group, Aqueduct Building, Rochester, NY Computer Science Research Department, West Group, Aqueduct Building, Rochester, NYView Profile , Khalid Al-Kofahi Computer Science Research Department, West Group, Aqueduct Building, Rochester, NY Computer Science Research Department, West Group, Aqueduct Building, Rochester, NYView Profile , Chris Kreilick Computer Science Research Department, West Group, Aqueduct Building, Rochester, NY Computer Science Research Department, West Group, Aqueduct Building, Rochester, NYView Profile , Brian Grom Computer Science Research Department, West Group, Aqueduct Building, Rochester, NY Computer Science Research Department, West Group, Aqueduct Building, Rochester, NYView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 60–67https://doi.org/10.1145/288627.288642Online:01 November 1998Publication History 9citation464DownloadsMetricsTotal Citations9Total Downloads464Last 12 Months23Last 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 SiteeReaderPDF
Focusing Search in Hierarchical Structures with Directory Sets
Authors: Guy Jacobson, Balachander Krishnamurthy, Divesh Srivastava, Dan Suciu
Venue: CIKM
Year: 1998

Keyword-based searches on the World Wide Web are often of limited use, because they return too many uninteresting matches. We propose here a novel mechanism that permits the user to specify directory sets to restrict the space of documents searched, and, at the same time, increase the speed of the search. We view the Web as a single, huge hierarchy, reflected in the structure of the URLs. We refer to each subtree in this hierarchy as a directory, and group semantically related documents from multiple directories into a directory set. Starting from a collection of pre-defined directory sets, a user can dynamically generate new directory sets by using operators in a directory set algebra, and focus keywordbased searches to documents that belong to a (pre-defined or dynamically generated) directory set. We design algorithms for efficiently evaluating expressions in the directory set algebra, and describe a technique for tightly integrating directory sets into keyword-based search engines....
Flexible List Management in a Directory
Authors: H. V. Jagadish, Mark A. Jones, Divesh Srivastava, Dimitra Vista
Venue: CIKM
Year: 1998

Article Free Access Share on Flexible list management in a directory Authors: H. V. Jagadish AT&T Labs-Research AT&T Labs-ResearchView Profile , Mark A. Jones AT&T Labs-Research AT&T Labs-ResearchView Profile , Divesh Srivastava AT&T Labs-Research AT&T Labs-ResearchView Profile , Dimitra Vista AT&T Labs-Research AT&T Labs-ResearchView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 10–19https://doi.org/10.1145/288627.288636Online:01 November 1998Publication History 6citation234DownloadsMetricsTotal Citations6Total Downloads234Last 12 Months5Last 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 Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
A Database Disk Buffer Management Algorithm Based on Prefetching
Authors: H. Seok Jeon, Sam H. Noh
Venue: CIKM
Year: 1998

This paper proposes a prefetch-based disk buffer management algorithm, which we call W²R (Weighing/Waiting Room). Instead of using elaborate prefetching schemes to decide which block to prefetch and when, we simply follow the LRU-OBL (One Block Lookahead) approach and prefetch the logical next block along with the block that is being referenced. The basic difference is that the W²R algorithm logically partitions the buffer into two rooms, namely the Weighing Room and the Waiting Room. The referenced, hence fetched block is placed in the Weighing Room, while the prefetched logical next block is placed in the Waiting Room. By so doing, we alleviate some inherent deficiencies of blindly prefetching the logical next block of a referenced block. Specifically, a prefetched block that is never used may replace a possibly valuable block and a prefetched block, though referenced in the future, may replace a block that is used earlier than itself. Using the DB2 and OLTP traces, we show t...
Sibling Clustering of Tree-Based Spatial Indexes for Efficient Spatial Query Processing
Authors: Kihong Kim, Sang Kyun Cha
Venue: CIKM
Year: 1998

Article Free Access Share on Sibling clustering of tree-based spatial indexes for efficient spatial query processing Authors: Kihong Kim School of Electrical Eng., Seoul Nat'l Univ., #807 Kwanak P.O. Box 34, Seoul 151-742 korea School of Electrical Eng., Seoul Nat'l Univ., #807 Kwanak P.O. Box 34, Seoul 151-742 koreaView Profile , Sang K. Cha School of Electrical Eng., Seoul Nat'l Univ., #807 Kwanak P.O. Box 34, Seoul 151-742 korea School of Electrical Eng., Seoul Nat'l Univ., #807 Kwanak P.O. Box 34, Seoul 151-742 koreaView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998Pages 398–405https://doi.org/10.1145/288627.288686Published:01 November 1998Publication History 21citation368DownloadsMetricsTotal Citations21Total Downloads368Last 12 Months21Last 6 weeks4 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
Incremental Maintenance for Dynamic Database-Derived HTML Pages in Digital Libraries
Authors: Ken C. K. Lee, Hong Va Leong, Antonio Si
Venue: CIKM
Year: 1998

Article Free Access Share on Incremental maintenance for dynamic database-derived HTML pages in digital libraries Authors: Ken C. K. Lee Department of Computing, the Hong Kong Polytechnic University, Hung Hom, Hong kong Department of Computing, the Hong Kong Polytechnic University, Hung Hom, Hong kongView Profile , Hong V. Leong Department of Computing, the Hong Kong Polytechnic University, Hung Hom, Hong kong Department of Computing, the Hong Kong Polytechnic University, Hung Hom, Hong kongView Profile , Antonio Si Sun Microsystems Inc., Palo Alto, CA Sun Microsystems Inc., Palo Alto, CAView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 20–29https://doi.org/10.1145/288627.288637Online:01 November 1998Publication History 2citation619DownloadsMetricsTotal Citations2Total Downloads619Last 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 Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
MALM: A Framework for Mining Sequence Database at Multiple Abstraction Levels
Authors: Chung-Sheng Li, Philip S. Yu, Vittorio Castelli
Venue: CIKM
Year: 1998

Article MALM: a framework for mining sequence database at multiple abstraction levels Share on Authors: Chung-Sheng Li IBM Thomas J.Watson Research Center, P.O. Box 704, Yorktown Heights, NY IBM Thomas J.Watson Research Center, P.O. Box 704, Yorktown Heights, NYView Profile , Philip S. Yu IBM Thomas J.Watson Research Center, P.O. Box 704, Yorktown Heights, NY IBM Thomas J.Watson Research Center, P.O. Box 704, Yorktown Heights, NYView Profile , Vittorio Castelli IBM Thomas J.Watson Research Center, P.O. Box 704, Yorktown Heights, NY IBM Thomas J.Watson Research Center, P.O. Box 704, Yorktown Heights, NYView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 267–272https://doi.org/10.1145/288627.288666Online:01 November 1998Publication History 38citation409DownloadsMetricsTotal Citations38Total Downloads409Last 12 Months5Last 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
Triple-Node Hierarchies for Object-Oriented Database Indexing
Authors: Frank Hing-Wah Luk, Ada Wai-Chee Fu
Venue: CIKM
Year: 1998

An indexing structure called triple-node hierarchy is proposed for enhancing query processing in object-oriented database systems. The proposed structure provides efficient support for object references along an aggregation hierarchy by maintaining direct mapping between objects of interested pairs of classes. The intermediate classes along the object path are maintained separately for update purpose. We show that the proposed structure can achieve better performance compared to the previously known methods. The superior performance is also demonstrated by a set of simulations based on a cost model that we have developed. With some modification, the proposed structure can also provide fast support for object navigation in an integration of aggregation and inheritance hierarchies. Our results show that the extended triple-node hierarchy performs better than the best previous method known to us. keywords: object-oriented databases, indexing, aggregation, inheritance, performance analysis...
Memory Allocation Strategies for Complex Decision Support Queries
Authors: Biswadeep Nag, David J. DeWitt
Venue: CIKM
Year: 1998

Complex decision support queries, as exemplified by the TPC-D benchmark, make heavy use of join, aggregation and sorting operations. These operations can be very memory intensive and it is unlikely (particularly in a multi-user environment) that a database system will always have enough memory to completely satisfy the demands of all concurrently running operators. In this paper we propose, analyze and evaluate four different algorithms that distribute available memory among operators in ways that satisfy all operator requirements and concurrent schedulability constraints. One of these algorithms, based on linear programming, is also optimal in that it is guaranteed to produce the best query response time. We also show how these algorithms can be extended to work on shared-nothing parallel database systems. All the proposed strategies are completely general and can be used with any extended relational operations that show a linear improvement in performance with increased memory availa...
An Automatic Techniques for Detecting Type Conflicts in Database Schemes
Authors: Luigi Palopoli, Domenico Saccà, Domenico Ursino
Venue: CIKM
Year: 1998

Article Free Access Share on An automatic technique for detecting type conflicts in database schemes Authors: Luigi Palopoli Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabra, 87036 Rende (CS), Italy Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabra, 87036 Rende (CS), ItalyView Profile , Domenico Saccá View Profile , Domenico Ursino Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabra, 87036 Rende (CS), Italy Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabra, 87036 Rende (CS), ItalyView Profile Authors Info & Claims CIKM '98: Proceedings of the seventh international conference on Information and knowledge managementNovember 1998 Pages 306–313https://doi.org/10.1145/288627.288671Online:01 November 1998Publication History 22citation346DownloadsMetricsTotal Citations22Total Downloads346Last 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 AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Image Similarity Retrieval by Spatial Constraints
Authors: Dimitris Papadias, Nikos Mamoulis, Dimitris Meretakis
Venue: CIKM
Year: 1998

This paper deals with queries involving the retrieval of images that contain certain object configurations. Consider, for instance, that a user wants to “find all images where there exists a building adjacent to the west side of a park which is southwest and near a commercial center”. This query can be formulated as a constraint satisfaction problem (CSP) where the query variables are nodes of the corresponding constraint network and the image objects constitute the domain of each variable. The arcs of the network correspond to spatial constraints (e.g., adjacent ∧ west (X1,X2), southwest ∧ near (X2,X3)). Problems of the above nature are, in general, intractable. In addition, spatial constraints (e.g., southwest, near) lack universally accepted semantics and cannot always be modeled by crisp relations; a fact that further complicates query processing. This paper focuses on the development of effective methods that take advantage of the special structure of the spatial domain to achieve good average performance even for large images and queries.
Document Classification Using Multiword Features
Authors: Ron Papka, James Allan
Venue: CIKM
Year: 1998

We investigate the use of multiword query features to improve the effectiveness of text-retrieval systems that accept natural-language queries. A relevance feedback process is explained that expands an initial query with single and multiword features. The multiword features are modelled as a set of words appearing within windows of varying sizes. Our experimental results suggest that windows of larger span yield improvements in retrieval over windows of smaller span. This result gives rise to a query contraction process that prunes 25% of the features in an expanded query with no loss in retrieval effectiveness. 1 Introduction The following work investigates the representation for queries used in text-based information retrieval systems. The query representation described has applications in document filtering, routing, and clustering in addition to website searching. Our primary focus is the use of query features that represent concepts expressible in natural language by multiple word...