waashk/acm huggingface dataset:
arc: an oai service provider for cross-archive searching  the usefulness of the many on-line journals and scientific digital lib raries that exist today is limited by the lack of a service that can federate them through a unified interface. the open archive initiative (oai) is one major effort to address technical interoperability among distributed archives. the objective of oai is to develop a framework to facilitate the discovery of content in distributed archives. in this paper, we describe our experience and lessons learned in building arc, the first federated searching service based on the oai protocol. arc harvests metadata from several oai compliant archives, normalizes them, and stores them in a search service based on a relational database (mysql or oracle). at present we have over 165k metadata records from 16 data providers from various domains.  xiaoming liu kurt maly mohammad zubair michael l. nelson
user population and user contributions to virtual publics: a systems model  this paper provides a comprehensive review of empirical research into user contributions to computer-mediated discourse in public cyber-spaces, referred to here as virtual publics. this review is used to build a systems model of such discourse. the major components of the model are i) critical mass, ii) social loafing, and iii) the collective impact of individual cognitive constraints on the processing of group messages. by drawing these three components into a single model it becomes possible to describe the shape of a "user-contributions/user-population function" after controlling for context.  virtual publics can be created with the support of various technologies including email, newsgroups, webbased bulletin boards etc. traditionally the choice of technology platform and the way it is used has largely depended on arbitrary factors. this paper suggests that choices of this nature can be based on knowledge about required segmentation points for discourse as they relate to a particular type of technology. this is because the "user- contributions/user-population function" will map differently to different classes of technology. similarly the different classes of technologies used to enable virtual publics will each have different stress zones at which users will experience information overload resulting from computer mediated discourse.  quentin jones sheizaf rafaeli
a theory of stimulus-response compatibility applied to human-computer interaction  a goms theory of stimulus-response compatibility is presented and applied to remembering computer command abbreviations. two abbreviation techniques, vowel-deletion and special-character-plus-first- letter, are compared in an encoding task. significant differences are found in the time to type the first letter of the abbreviation, and in the time to complete the typing of the abbreviation. these differences are analyzed using the theory which produces an excellent quantitative fit to the data (r2 = 0.97).  bonnie e. john paul s. rosenbloom allen newell
experiments with a component theory of probabilistic information retrieval based on single terms as document components  a component theory of information retrieval using single content terms as component for queries and documents was reviewed and experimented with. the theory has the advantages of being able to (1) bootstrap itself, that is, define initial term weights naturally based on the fact that items are self relevent; (2) make use of within-item term frequencies; (3) account for query- focused and document- focused indexing and retrieval strategies cooperatively; and (4) allow for component-specific feedback if such information is available. retrieval results with four collections support the effectiveness of all the first three aspects, except for predictive retrieval. at the initial indexing stage, the retrieval theory performed much more consistantly across collections than croft's model and provided results comparable to salton's tf*idf approach. an inverse collection term frequency (ictf) formula was also tested that performed much better than the inverse document frequency (idf). with full feedback retrospective retrieval, the component theory performed substantially better than croft's, because of the highly specific nature of document-focused feedback. repetitive retireval results with partial relevance feedback mirrored those for the retrospective. however, for the important case of predictive retrieval using residual ranking, results were not unequivocal.  k. l. kwok
automating the assignment of submitted manuscripts to reviewers  the 117 manuscripts submitted for the hypertext '91 conference were assigned to members of the review committee, using a variety of automated methods based on information retrieval principles and latent semantic indexing. fifteen reviewers provided exhaustive ratings for the submitted abstracts, indicating how well each abstract matched their interests. the automated methods do a fairly good job of assigning relevant papers for review, but they are still somewhat poorer than assignments made manually by human experts and substantially poorer than an assignment perfectly matching the reviewers' own ranking of the papers. a new automated assignment method called "n of 2n" achieves better performance than human experts by sending reviewers more papers than they actually have to review and then allowing them to choose part of their review load themselves.  susan t. dumais jakob nielsen
an evaluation of earcons for use in auditory human-computer interfaces  an evaluation of earcons was carried out to see whether they are an effective means of communicating information in sound. an initial experiment showed that earcons were better than unstructured bursts of sound and that musical timbres were more effective than simple tones. a second experiment was then carried out which improved upon some of the weaknesses shown up in experiment 1 to give a significant improvement in recognition. from the results of these experiments some guidelines were drawn up for use in the creation of earcons. earcons have been shown to be an effective method for communicating information in a human-computer interface.  stephen a. brewster peter c. wright alistair d. n. edwards
object-relational database systems (tutorial): principles, products and challenges  object-relational database systems, a.k.a. "universal servers," are emerging as the next major generation of commercial database system technology. products from relational dbms vendors including ibm, informix, oracle, unisql, and others, include object-relational features today, and all of the major vendors appear to be on course to delivering full object-relational support in their products over the next few years. in addition, the sql3 standard is rapidly solidifying in this area. the goal of this tutorial is to explain what the key features are of object-relational database systems, review what today's products provide, and then look ahead to where these systems are heading. the presentation will be aimed at general sigmod audience, and should therefore be appropriate for users, practitioners, and/or researchers who want to learn about object- relational database systems.  michael j. carey nelson m. mattos anil k. nori
classic: a structural data model for objects  classic is a data model that encourages the description of objects not only in terms of their relations to other known objects, but in terms of a level of intensional structure as well. the classic language of structured descriptions permits i) partial descriptions of individuals, under an 'open world' assumption, ii) answers to queries either as extensional lists of values or as descriptions that necessarily hold of all possible answers, and iii) an easily extensible schema, which can be accessed uniformly with the data. one of the strengths of the approach is that the same language plays multiple roles in the processes of defining and populating the db, as well as querying and answering.  classic (for which we have a prototype main-memory implementation) can actively discover new information about objects from several sources: it can recognize new classes under which an object falls based on a description of the object, it can propagate some deductive consequences of db updates, it has simple procedural recognizers, and it supports a limited form of forward- chaining rules to derive new conclusions about known objects.  the kind of language of descriptions and queries presented here provides a new arena for the search for languages that are more expressive than conventional dbms languages, but for which query processing is still tractable. this space of languages differs from the subsets of predicate calculus hitherto explored by deductive databases.  alexander borgida ronald j. brachman deborah l. mcguinness lori alperin resnick
on bi-level conceptual schemas  the advent of entity-relationship (e-r) model has revolutionized the database design process. the overwhelming success of entity-relationship approach to database design partly lies in the simplicity and semantic clarity of the e-r model. however, two seemingly conflicting measurements of database design: logical-clarity and physical-efficiency, force database designers to choose either logically-clear design or physically-efficient design. as a result, the resulting design is either logically-clear or physically- efficient, but not both. this paper is to provide a remedy for this situation. in this paper, we first discuss the concept of logical-clarity and physical- efficiency of logical database design. then the concept of bi- level conceptual schema is introduced. the bi-level conceptual schema concept allows us to create a logical database design that is both logically-clear and physically-efficient. finally, a database management system prototype (dbmsb) that supports bi-level conceptual schema is described.  eugene y. sheng
a fifth generation approach to intelligent information retrieval  this paper briefly examines certain of the intelligent information retrieval (iir) mechanisms used in the reseda system, a system equipped with "reasoning" capabilities in the field of complex biographical data management. particular attention is paid to a description of the different "levels" of inference procedure which can be executed by the system. the intention is to show that the technical solutions to iir problems implemented in reseda are of an equivalent level to those now proposed in the same field by the japanese project for fifth generation computer systems.  gian piero zarri
integrity = validity + completeness  database integrity has two complementary components: validity, which guarantees that all false information is excluded from the database, and completeness, which guarantees that all true information is included in the database. this article describes a uniform model of integrity for relational databases, that considers both validity and completeness. to a large degree, this model subsumes the prevailing model of integrity (i.e., integrity constraints). one of the features of the new model is the determination of the integrity of answers issued by the database system in response to user queries. to users, answers that are accompanied with such detailed certifications of their integrity are more meaningful. first, the model is defined and discussed. then, a specific mechanism is described that implements this model. with this mechanism, the determination of the integrity of an answer is a process analogous to the determination of the answer itself.  amihai motro
serf: odmg-based generic re-structuring facility  the age of information management and with it the advent of increasingly sophisticated technologies have kindled a need in the database community and others to re-structure existing systems and move forward to make use of these new technologies. legacy application systems are being transformed to newer state-of-the-art systems, information sources are being mapped from one data model to another, a diversity of data sources are being transformed to load, cleanse and consolidate data into modern data-warehouses [cr99].  re-structuring is thus a critical task for a variety of applications. for this reason, most object-oriented database systems (oodb) today support some form of re-structuring support [tec94, obj93, bkkk87]. this existing support of current oodbs [bkkk87, tec94, obj93] is limited to a pre-defined taxonomy of simple fixed-semantic schema evolution operations. however, such simple changes, typically to individual types only, are not sufficient for many advanced applications [bre96]. more radical changes, such as combining two types of redefining the relationship between two types, are either very difficult or even impossible to achieve with current commercial database technology [tec94, obj93]. in fact, most oodbs would typically require the user to write ad-hoc programs to accomplish such transformations. research that has begun to look into the issue of complex changes [bre96, ler96] is still limited by providing a fixed set of some selected (even if now more complex) operations.  to address these limitations of the current restructuring technology, we have proposed the serf framework which aims at providing a rich environment for doing complex user-defined transformations flexibly, easily and correctly [cjr98b]. the goal of our work is to increase the usability and utility of the serf framework and its applicability to re-structuring problems beyond oodb evolution. towards that end, we provide re-usable transformations via the notion of serf templates that can be packaged into libraries, thereby increasing the portability of these transformations. we also now have a first cut at providing an assurance of consistency for the users of this system, a semantic optimizer that provides some performance improvements via enhanced query optimization techniques with emphasis on the re-structuring primitives [cnr99]. in this demo we give an overview of the serf framework, its current status and the enhancements that are planned for the future. we also present an example of the application of serf to a domain other than schema evolution, i.e., the web restructuring.  e. a. rundensteiner k. claypool m. li l. chen z. zhang c. natarajan j. jin s. de lima s. weiner
calculating constraints on relational expression  this paper deals with the problem of determining which of a certain class of constraints hold on a given relational algebra expression where the base relations come from a given schema. the class of constraints includes functional dependencies, equality of domains, and constancy of domains. the relational algebra consists of projection, selection, restriction, cross product, union, and difference. the problem as given is undecidable, but if set difference is removed from the algebra, there is a solution. operators specifying a closure function (similar to functional dependency closure on one relation) are defined; these will generate exactly the set of constraints valid on the given relational algebra expression. we prove that the operators are sound and complete.  a. klug
database systems management and oracle8  oracle's corporate mission is to enable the information age through network computing, a vision of broader access to information for all and the empowerment and increased productivity that can result. the technology implications of the network computing vision are ubiquitous access via low- cost appliances to smaller numbers of larger databases, accessed via professionally managed networks compliant with open internetworking protocols. the latest release of the oracle data server, oracle8, provides new technology for management of very large databases containing rich and user-defined data types, and is continuing to evolve to make it economically beneficial to store all forms of digital information in a database.  c. gregory doherty
constant interaction-time scatter/gather browsing of very large document collections  the scatter/gather document browsing method uses fast document clustering to produce table-of-contents-like outlines of large document collections. previous work [1] developed linear-time document clustering algorithms to establish the feasibility of this method over moderately large collections. however, even linear-time algorithms are too slow to support interactive browsing of very large collections such as tipster, the darpa standard text retrieval evaluation collection. we present a scheme that supports constant interaction-time scatter/gather of arbitrarily large collections after near- linear time preprocessing. this involves the construction of a cluster hierarchy. a modification of scatter/gather employing this scheme, and an example of its use over the tipster collection are presented.  douglass r. cutting david r. karger jan o. pedersen
a comparison of three user interfaces to relational microcomputer data bases  payoff idea. different styles of user interfaces can dramatically affect data base capabilities. in an environment comprising many different data bases, the goal is to select one data base management system (dbms) that provides the best selection of design tools, minimizes development times, and enforces relational rules. this article presents a case study performed at the hospital of the university of pennsylvania, in which a test data base was developed for implementation with three dbmss, each with a distinctly different user and programmer interface.  carl medsker margaret christensen il-yeol song
tutorial database mining  we view database mining as the efficient construction and verification of models of patterns embedded in large databases. many of the database mining problems have been motivated by the practical decision support problems faced by most large retail organizations. in the quest project at the ibm almaden research center, we have focussed on three classes of database mining problems involving classification, associations, and sequences. in this tutorial, i will draw upon my quest experience to present my perspective of database mining, describe current work, and present some open problems.  rakesh agrawal
self-adaptive, on-line reclustering of complex object data  a likely trend in the development of future cad, case and office information systems will be the use of object-oriented database systems to manage their internal data stores. the entities that these applications will retrieve, such as electronic parts and their connections or customer service records, are typically large complex objects composed of many interconnected heterogeneous objects, not thousands of tuples. these applications may exhibit widely shifting usage patterns due to their interactive mode of operation. such a class of applications would demand clustering methods that are appropriate for clustering large complex objects and that can adapt on-line to the shifting usage patterns. while most object-oriented clustering methods allow grouping of heterogeneous objects, they are usually static and can only be changed off- line. we present one possible architecture for performing complex object reclustering in an on-line manner that is adaptive to changing usage patterns. our architecture involves the decomposition of a clustering method into concurrently operating components that each handle one of the fundamental tasks involved in reclustering, namely statistics collection, cluster analysis, and reorganization. we present the results of an experiment performed to evaluate its behavior. these results show that the average miss rate for object accesses can be effectively reduced using a combination of rules that we have developed for deciding when cluster analyses and reorganizations should be performed.  william j. mciver roger king
the human aspects of computing: a note on this collection  what makes computer users happy? can systems help humans to use them? does programming sharpen other thinking skills? is computer anxiety important? will programmers use ada packages? how do students learn programming concepts? are spelling correctors at their limits? when does the work load on a terminal get too heavy? are instruction sets too large?  these nine questions define some important issues for those of us who study human factors---the ways hardware and software affect, and are affected by, their users. although the major accomplishments in the field will always rest on careful inspiration, to some degree these questions can be resolved empirically.  generally, empirical work falls into three broad categories:  with experiments the goal is to determine whether some design or principle a is better than some design or principle b. ideally, experimenters should make some tentative hypothesis first, or at least, decide what needs to be known.  in data collection the objective is to observe users, give questionnaires, examine listings, count errors, or otherwise record data. by examining such data, we are able to draw conclusions and discover trouble spots.  general observation is a method that involves complete systems or prototypes. these systems are observed, measured in broad ways, compared, or iteratively redesigned to complement the behavior of typical users. the goal is to understand the needs of users and to optimize system behavior.  although not at all by choice, only the first two of these categories are represented in this collection.  as with most papers that are accepted and appear in print, the reviewers or editors have some special reason for liking a paper in the first place. this reason may not appear in the reviews of the paper, but it does capture some underlying point or principle deemed to be important.  each of the articles in this special section is a short description of a study addressing one of the nine questions. the results of these studies do not always reinforce conventional wisdom. some of the conclusions are provocative. i invite you to read the articles and to see whether you agree with their conclusions.  henry ledgard
xel: extended ephemeral logging for log storage management  extended ephemeral logging (xel) is a more general variation of the ephemeral logging (el) technique for managing a log of database activity on disk; it does not require a timestamp to be maintained with each object in the database. xel does not require periodic checkpoints and does not abort lengthy transactions as frequently as traditional firewall logging for the same amount of disk space. therefore, it is well suited for concurrent databases and applications which have a wide distribution of transaction lifetimes.  simulation results indicate that xel can offer significant savings in disk space, at the expense of slightly higher bandwidth for logging and more main memory. the reduced size of the log permits much faster recovery after a crash as well as cost savings.  john s. keen william j. dally
analysis of recovery in a database system using a write-ahead log protocol  in this paper we examine the recovery time in a database system using a write- ahead log protocol, such as aries [9], under the assumption that the buffer replacement policy is strict lru. in particular, analytical equations for log read time, data i/o, log application, and undo processing time are presented. our initial model assumes a read/write ratio of one, and a uniform access pattern. this is later generalized to include different read/write ratios, as well as a "hot set" model (i.e. x% of the accesses go to y% of the data). we show that in the uniform access model, recovery is dominated by data i/o costs, but under extreme hot-set conditions, this may no longer be true. furthermore, since we derive anaytical equations, recovery can be analyzed for any set of parameter conditions not discussed here.  anant jhingran pratap khedkar