OpenRaiser/Intern-Atlas huggingface dataset:
Transformation-Based Spatial Join
Authors: Ju-Won Song, Kyu-Young Whang, Young-Koo Lee, Min-Jae Lee, Sang-Wook Kim
Venue: CIKM
Year: 1999

Spatial join finds pairs of spatial objects having a specific spatial relationship in spatial database systems. A number of spatial join algorithms have recently been proposed in the literature. Most of them, however, perform the join in the original space. Joining in the original space has a drawback of dealing with sizes of objects and thus has difficulty in developing a formal algorithm that does not rely on heuristics. In this paper, we propose a spatial join algorithm based on the transformation technique. An object having a size in the two-dimensional original space is transformed into a point in the four-dimensional transform space, and the join is performed on these point objects. This can be easily extended to n-dimensional cases. We show the excellence of the proposed approach through analysis and extensive experiments. The results show that the proposed algorithm has a performance generally better than that of the R*-based algorithm proposed by Brinkhoff et al. This is a strong indicating that corner transformation preserves clustering among objects and that spatial operations can be performed better in the transform space than in the original space. This reverses the common belief that transformation will adversely affect clustering. We believe that our result will provide a new insight towards transformation-based spatial query processing.
Extracting Significant Time Varying Features from Text
Authors: Russell C. Swan, James Allan
Venue: CIKM
Year: 1999

We propose a simple statistical model for the frequency of occurrence of features in a stream of text. Adoption of this model allows us to use classical significance tests to filter the stream for interesting events. We tested the model by building a system and running it on a news corpus. By a subjective evaluation, the system worked remarkably well: almost all of the groups of identified tokens corresponded to news stories and were appropriately placed in time. A preliminary objective evaluation was also used to measure the quality of the system and it showed some of the weaknesses and the power of our approach.
Queryable Acyclic Production Systems
Authors: David Tanzer, Dennis E. Shasha
Venue: CIKM
Year: 1999

We pose a query problem about the behavior of a consultation system S: given a constraint formula q and a potential conclusion c for S, determine if there is a user input binding that satisfies q and causes S to conclude c. Existing rule-based expert systems, both forward and backward chaining[3], implement a consultation mechanism S, but are not designed for these queries about S. For general production systems, the queries are undecidable. Here we solve the problem for useful sublanguages of acyclic production systems.We implement a query tool in a Datalog + constraints framework, and optimize for “embedded decision trees” in the rule system. Our data complexity is T(n·ƒ(n)) in the size of the embedded trees, versus T(n·ƒ(n) + n2) for existing datalog evaluation algorithms, where ƒ(n) is the cost of destructively conjoining a constraint of unit size into a conjunction of n constraints.
Efficient Refreshment of Materialized Views with Multiple Sources
Authors: Hui Wang, Maria E. Orlowska, Weifa Liang
Venue: CIKM
Year: 1999

A data warehouse collects and maintains a large amount of data from multiple distributed and autonomous data sources. Often the data in it is stored in the form of materialized views in order to provide fast access to the integrated data. However, maintaining a certain level consistency of warehouse data with the source data is challenging in a distributed multiple source environment. Transactions containing multiple updates at one or more sources further complicate the consistency issue.
Clustering Transactions Using Large Items
Authors: Ke Wang, Chu Xu, Bing Liu
Venue: CIKM
Year: 1999

In traditional data clustering, similarity of a cluster of objects is measured by pairwise similarity of objects in that cluster. We argue that such measures are not appropriate for transactions that are sets of items. We propose the notion of large items, i.e., items contained in some minimum fraction of transactions in a cluster, to measure the similarity of a cluster of transactions. The intuition of our clustering criterion is that there should be many large items within a cluster and little overlapping of such items across clusters. We discuss the rationale behind our approach and its implication on providing a better solution to the clustering problem. We present a clustering algorithm based on the new clustering criterion and evaluate its effectiveness.
Rule-Based Query Optimization, Revisited
Authors: Lane Warshaw, Daniel P. Miranker
Venue: CIKM
Year: 1999

We present the architecture and a performance assessment of an extensible query optimizer written in Venus. Venus is a general-purpose active-database rule language embedded in C++. Following the developments in extensible database query optimizers, first in rule-based form, followed by optimizers written as object-oriented programs, the Venus-based optimizer avails to the advantages of both. Venus' modular structure allows us to go a step further and provide extensibility in search by defining parameterized search components in a declarative form that has the additional effect of integrating heuristic and cost-based optimization. We compare optimizers developed with Volcano, OPT++ and Venus. Venus' optimizing compiler yields code whose performance is comparable with Volcano and OPT++ on smaller queries. The ability to introduce additional pruning heuristics yields better scalability on larger queries. Evaluation of the system using quantitative software metrics supports a claim that the Venus-based optimizer is more easily maintained and extended than are its predecessors.
Architecture of a Networked Image Search and Retrieval System
Authors: Roger Weber, Jürg Bolliger, Thomas R. Gross, Hans-Jörg Schek
Venue: CIKM
Year: 1999

Large scale networked image retrieval systems face a number of problems that are not fully satisfied by current systems. On one hand, integrated solutions that store all image data centrally are often limited in terms of scalability and autonomy of data providers. On the other hand, WWW-based search engines proved to be fairly scalable, and data providers retain their autonomy. However, such engines often confront users with links to servers that are not available or to images that no longer exist, i.e., they are unable to keep their meta-database consistent with the repositories' contents. Furthermore, existing solutions often neglect the cost of image delivery. The considerable variations in the effective bandwidth in today's Internet lead to highly unpredictable response times, which are often intolerable from the user's point of view.
An Adaptive Algorithm for Learning Changes in User Interests
Authors: Dwi H. Widyantoro, Thomas R. Ioerger, John Yen
Venue: CIKM
Year: 1999

In this paper, we describe a new scheme to learn dynamic user's interests in an automated information filtering and gathering system running on the Internet. Our scheme is aimed to handle multiple domains of long-term and short-term user's interests simultaneously, which is learned through positive and negative user's relevance feedback. We developed a 3-descriptor approach to represent the user's interest categories. Using a learning algorithm derived for this representation, our scheme adapts quickly to significant changes in user interest, and is also able to learn exceptions to interest categories.
Database Model for Web-Based Cooperative Applications
Authors: Waldemar Wieczerzycki
Venue: CIKM
Year: 1999

In this paper we propose a model of a database that could become a kernel of cooperative database applications. First, we propose a new data model CDM (Collaborative Data Model) that is oriented for the specificity of multiuser environments, in particular: cooperation scenarios, cooperation techniques and cooperation management. Second, we propose to apply to databases supporting collaboration so called multiuser transactions. Multiuser transactions are flat transactions in which, in comparison to classical ACID transactions, the isolation property is relaxed.
Local Replication for Proxy Web Caches with Hash Routing
Authors: Kun-Lung Wu, Philip S. Yu
Venue: CIKM
Year: 1999

This paper studies controlled local replication for hash routing, such as CARP, among a collection of loosely-coupled proxy web cache servers. Hash routing partitions the entire URL space among the shared web caches, creating a single logical cache. Each partition is assigned to a cache server. Duplication of cache contents is eliminated and total incoming traffic to the shared web caches is minimized. Client requests for non-assigned-partition objects are forwarded to sibling caches. However, request forwarding increases not only inter-cache traffic but also cpu utilization, thus slows the client response time. We propose a controlled local replication of non-assigned-partition objects in each cache server to effectively reduce the inter-cache traffic. We use a multiple-exit LRU to implement controlled local replication. Trace-driven simulations are conducted to study the performance impact of local replication. The results show that (1) regardless of cache sizes, with a controlled local replication, the average response time, inter-cache traffic and CPU overhead can be effectively reduced without noticeable increases in incoming traffic; (2) for very large cache sizes, a larger amount of local replication can be allowed to reduce inter-cache traffic without increasing incoming traffic; and (3) local replication is effective even if clients are dynamically assigned to different cache servers.
Using Domain Knowledge in Knowledge Discovery
Authors: Suk-Chung Yoon, Lawrence J. Henschen, E. K. Park, S. A. M. Makki
Venue: CIKM
Year: 1999

With the explosive growth of the size of databases, many knowledge discovery applications deal with large quantities of data. There is an urgent need to develop methodologies which will allow the applications to focus search to a potentially interesting and relevant portion of the data, which can reduce the computational complexity of the knowledge discovery process and improve the interestingness of discovered knowledge. Previous work on semantic query optimization, which is an approach to take advantage of domain knowledge for query optimization, has demonstrated that significant cost reduction can be achieved by reformulating a query into a less expensive yet equivalent query which produces the same answer as the original one. In this paper, we introduce a method to utilize three types of domain knowledge in reducing the cost of finding a potentially interesting and relevant portion of the data while improving the quality of discovered knowledge. In addition, we propose a method to select relevant domain knowledge without an exhaustive search of all domain knowledge. The contribution of this paper is that we lay out a general framework for using domain knowledge in the knowledge discovery process effectively by providing guidelines.
Efficient and Effective Metasearch for a Large Number of Text Databases
Authors: Clement T. Yu, Weiyi Meng, King-Lup Liu, Wensheng Wu, Naphtali Rishe
Venue: CIKM
Year: 1999

Metasearch engines can be used to facilitate ordinary users for retrieving information from multiple local sources (text databases). In a metasearch engine, the contents of each local database is represented by a representative. Each user query is evaluated against the set of representatives of all databases in order to determine the appropriate databases to search. When the number of databases is very large, say in the order of tens of thousands or more, then a traditional metasearch engine may become inefficient as each query needs to be evaluated against too many database representatives. Furthermore, the storage requirement on the site containing the metasearch engine can be very large. In this paper, we propose to use a hierarchy of database representatives to improve the efficiency. We provide an algorithm to search the hierarchy. We show that the retrieval effectiveness of our algorithm is the same as that of evaluating the user query against all database representatives. We also show that our algorithm is efficient. In addition, we propose an alternative way of allocating representatives to sites so that the storage burden on the site containing the metasearch engine is much reduced.
Simple QSF-Trees: An Efficient and Scalable Spatial Access Method
Authors: Byunggu Yu, Ratko Orlandic, Martha W. Evens
Venue: CIKM
Year: 1999

The development of high-performance spatial access methods that can support complex operations of large spatial databases continues to attract considerable attention. This paper introduces QSF-trees, an efficient and scalable structure for indexing spatial objects, which has some important advantages over R*-trees. QSF-trees eliminate overlapping of index regions without forcing object clipping or sacrificing the selectivity of spatial operations. The method exploits the semantics of topological relations between spatial objects to further reduce the number of index nodes visited during the search. A series of experiments involving randomly-generated spatial objects was conducted to compare the structure with two variations of R*-trees. The experiments show QSF-trees to be more efficient and more scalable to the increase in the data-set size, the size of spatial objects, and the number of dimensions of the spatial universe.
Ontology-Based Web Site Mapping for Information Exploration
Authors: Xiaolan Zhu, Susan Gauch, Lutz Gerhard, Nicholas Kral, Alexander Pretschner
Venue: CIKM
Year: 1999

Centralized search process requires that the whole collection reside at a single site. This imposes a burden on both the system storage of the site and the network traffic near the site. It thus comes to require the search process to be distributed. Recently, more and more Web sites provide the ability to search their local collection of Web pages. Query brokering systems are used to direct queries to the promising sites and merge the results from these sites. Creation of meta-information of the sites plays an important role in such systems. In this article, we introduce an ontology-based web site mapping method used to produce conceptual meta-information, the Vector Space approach, and present a serial of experiments comparing it with Naïve-Bayes approach. We found that the Vector Space approach produces better accuracy in ontology-based web site mapping.
Theoretical Foundations of Schema Restructuring in Heterogeneous Multidatabase Systems
Authors: Joseph Albert
Venue: CIKM
Year: 2000

Article Free Access Share on Theoretical foundations of schema restructuring in heterogeneous multidatabase systems Author: Joseph Albert Computer Science Dept., Portland State University, P.O. Box 751, Portland, OR Computer Science Dept., Portland State University, P.O. Box 751, Portland, ORView Profile Authors Info & Claims CIKM '00: Proceedings of the ninth international conference on Information and knowledge managementNovember 2000 Pages 461–470https://doi.org/10.1145/354756.354854Online:06 November 2000Publication History 6citation428DownloadsMetricsTotal Citations6Total Downloads428Last 12 Months4Last 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
First Story Detection In TDT Is Hard
Authors: James Allan, Victor Lavrenko, Hubert Jin
Venue: CIKM
Year: 2000

Article Free Access Share on First story detection in TDT is hard Authors: James Allan Center for Intelligent Information Retrieval, Department of Computer Science, University of Massachusetts, Amherst, Massachusetts Center for Intelligent Information Retrieval, Department of Computer Science, University of Massachusetts, Amherst, MassachusettsView Profile , Victor Lavrenko Center for Intelligent Information Retrieval, Department of Computer Science, University of Massachusetts, Amherst, Massachusetts Center for Intelligent Information Retrieval, Department of Computer Science, University of Massachusetts, Amherst, MassachusettsView Profile , Hubert Jin MapQuest.Com, Inc., Mountvile, Pennsylvania MapQuest.Com, Inc., Mountvile, PennsylvaniaView Profile Authors Info & Claims CIKM '00: Proceedings of the ninth international conference on Information and knowledge managementNovember 2000 Pages 374–381https://doi.org/10.1145/354756.354843Online:06 November 2000Publication History 97citation1,078DownloadsMetricsTotal Citations97Total Downloads1,078Last 12 Months24Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Using Star Clusters for Filtering
Authors: Javed A. Aslam, Katya Pelekhov, Daniela Rus
Venue: CIKM
Year: 2000

Article Free Access Share on Using star clusters for filtering Authors: Javed Aslam Department of Computer Science, Dartmouth College, Hanover, NH Department of Computer Science, Dartmouth College, Hanover, NHView Profile , Katya Pelekhov Department of Computer Science, Dartmouth College, Hanover, NH Department of Computer Science, Dartmouth College, Hanover, NHView Profile , Daniela Rus Department of Computer Science, Dartmouth College, Hanover, NH Department of Computer Science, Dartmouth College, Hanover, NHView Profile Authors Info & Claims CIKM '00: Proceedings of the ninth international conference on Information and knowledge managementNovember 2000 Pages 306–313https://doi.org/10.1145/354756.354833Published:06 November 2000Publication History 8citation398DownloadsMetricsTotal Citations8Total Downloads398Last 12 Months8Last 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
On Efficient Storage Space Distribution Among Materialized Views and Indices in Data Warehousing Environments
Authors: Ladjel Bellatreche, Kamalakar Karlapalem, Michel Schneider
Venue: CIKM
Year: 2000

Article On efficient storage space distribution among materialized views and indices in data warehousing environments Share on Authors: Ladjel Bellatreche University of Science & Technology, Clear Water Bay, Kowloon, Hong Kong University of Science & Technology, Clear Water Bay, Kowloon, Hong KongView Profile , Kamalakar Karlapalem University of Science & Technology, Clear Water Bay, Kowloon, Hong Kong University of Science & Technology, Clear Water Bay, Kowloon, Hong KongView Profile , Michel Schneider Université Blaise Pascal, 63177 Aubière Cédex, France Université Blaise Pascal, 63177 Aubière Cédex, FranceView Profile Authors Info & Claims CIKM '00: Proceedings of the ninth international conference on Information and knowledge managementNovember 2000 Pages 397–404https://doi.org/10.1145/354756.354846Online:06 November 2000Publication History 8citation642DownloadsMetricsTotal Citations8Total Downloads642Last 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
Models for Reader Interaction with Texts
Authors: Daniel Berleant
Venue: CIKM
Year: 2000

In this paper we discuss models for systems that support reading. Our account identifies important models and presents a framework for organizing them. To evaluate this account, we show its ability to suggest a wide range of text presentation systems, many of them novel. This evaluation not only provides interesting ideas for future systems, it also shows the usefulness of the account, and further, exemplifies a general approach to evaluating meta-level discussions such as this, namely, evaluating by assessing ability to generate interesting implications.
High Performance Clustering Based on the Similarity Join
Authors: Christian Böhm, Bernhard Braunmüller, Markus M. Breunig, Hans-Peter Kriegel
Venue: CIKM
Year: 2000

A broad class of algorithms for knowledge discovery in databases (KDD) relies heavily on similarity queries, i.e. range queries or nearest neighbor queries, in multidimensional feature spaces. Many KDD algorithms perform a similarity query for each point stored in the database. This approach causes serious performance degenerations if the considered data set does not fit into main memory. Usual cache strategies such as LRU fail because the locality of KDD algorithms is typically not high enough. In this paper, we propose to replace repeated similarity queries by the similarity join, a database primitive prevalent in multimedia database systems. We present a schema to transform query intensive KDD algorithms into a representation using the similarity join as a basic operation without affecting the correctness of the result of the considered algorithm. In order to perform a comprehensive experimental evaluation of our approach, we apply the proposed transformation to the clustering algor...
Personal Ontologies for Web Navigation
Authors: Jason Chaffee, Susan Gauch
Venue: CIKM
Year: 2000

The publicly indexable Web contains an estimated 800 million pages, however it is estimated that the largest search engine contains only 300 million of these pages. As the number of Internet users and the number of accessible Web pages grows, it is becoming increasingly difficult for users to find documents that are relevant to their particular needs. Often users must browse through a large hierarchy of categories to find the information for which they are looking. To provide the user with the most useful information in the least amount of time, we need a system that uses each user's view of the world for classification. This paper explores a way to use a user's personal arrangement of concepts to navigate the Web. This system is built by using the characterizations for a particular site created by the Ontology Based Informing Web Agent Navigation (OBIWAN) system and mapping from them to the user's personal ontologies. OBIWAN allows users to explore multiple sites via the same browsing hierarchy. This paper extends OBIWAN to allow users to explore multiple sites via their own browsing hierarchy. The mapping of the reference ontology to the personal ontology is shown to have a promising level of correctness and precision.