waashk/acm huggingface dataset:
a practitioner's view of techniques used in data warehousing for sifting through data to provide information (keynote address)  over the past 10 years data warehousing evolved from providing 'nice to know' data to 'need to know' information. the decision support systems providing summarized reports to executives have advanced to integrated information factories providing vital information to the desktops of knowledge workers. data warehousing has benefited through the use advanced techniques of sifting through data to produce information. this discussion will cover data mining techniques used in specific business cases as well as attempt to describe problems that still exist (and could be researched) in the business intelligence arena.  jim scoggins
query expansion using domain-adapted, weighted thesaurus in an extended boolean model  in this paper, we address there important issues with query expansion using a thesaurus; how to give weights to the terms in expanded queries, how to select additional search terms in the thesaurus, and how to enrich the terms in the manual thesaurus (namely, thesaurus reconstruction). to weight the terms in expanded queries, we construct the weighted thesaurus that has a similarity value between the terms in the thesaurus, using statistical co-occurrence in a corpus. to enrich the terms in the manual thesaurus, domain dependent terms which occur in a corpus are inserted into the weighted thesaurus using the co- occurrence information. in this paper, the reconstructed thesaurus with weights is defined as a domain- adapted, weighted thesaurus. then we explain query expansion using the domain- adapted, weighted thesaurus in an extended boolean retrieval model. to select additional search terms during query expansion, our model uses semi-automatic query expansion and a restriction method. in the experiments, our system had almost twice the recall of the boolean retrieval system not using the thesaurus or the query expansion retrieval system using the original thesaurus. and also, the precision of our system was almost the same precision as the other systems.  oh-woog kwon myoung-cheol kim key-sun choi
mining frequent patterns without candidate generation  mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. most of the previous studies adopt an apriori-like candidate set generation-and-test approach. however, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns.  in this study, we propose a novel frequent pattern tree (fp-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develop an efficient fp-tree-based mining method, fp-growth, for mining _the complete set of frequent patterns_ by pattern fragment growth. efficiency of mining is achieved with three techniques: (1) a large database is compressed into a highly condensed, much smaller data structure, which avoids costly, repeated database scans, (2) our fp-tree-based mining adopts a pattern fragment growth method to avoid the costly generation of a large number of candidate sets, and (3) a partitioning- based, divide-and-conquer method is used to decompose the mining task into a set of smaller tasks for mining confined patterns in conditional databases, which dramatically reduces the search space. our performance study shows that the fp-growth method is efficient and scalable for mining both long and short frequent patterns, and is about an order of magnitude faster than the apriori algorithm and also faster than some recently reported new frequent pattern mining methods.  jiawei han jian pei yiwen yin
parallelism and recovery in database systems  in this paper a new method to increase parallelism in database systems is described. use is made of the fact that for recovery reasons, we often have two values for one object in the database---the new one and the old one. introduced and discussed in detail is a certain scheme by which readers and writers may work simultaneously on the same object. it is proved that transactions executed according to this scheme have the correct effect; i.e., consistency is preserved. several variations of the basic scheme which are suitable depending on the degree of parallelism required, are described.  r. bayer h. heller a. reiser
answer garden: a tool for growing organizational memory  answer garden allows organizations to develop databases of commonly asked questions that grow "organically" as new questions arise and are answered. it is designed to help in situations (such as field service organizations and customer "hot lines") where there is a continuing stream of questions, many of which occur over and over, but some of which the organization has never seen before. the system includes a branching network of diagnostic questions that helps users find the answers they want. if the answer is not present, the system automatically sends the question to the appropriate expert, and the answer is returned to the user as well as inserted into the branching network. experts can also modify this network in response to users' problems.  our initial answer garden database contains questions and answers about how to use the x window system.  m. s. ackerman t. w. malone
communication - nets for the specification of operator dialogs  the model of a man - machine - system is the basis of the proposed notation. it consists of the components man and machine. with these (statical) components a (dynamic) process, called man - machine - communication or man - machine - dialog, is realized.  the (three) possible dynamic interfaces are described. according to /car;69/ an evaluation, decision and control module for the exchange of information belongs to an active bidirectional communication. an operator dialog is such a communication.  w. k. epple u. rembold
accuracy measures for evaluating computer pointing devices  in view of the difficulties in evaluating computer pointing devices across different tasks within dynamic and complex systems, new performance measures are needed. this paper proposes seven new accuracy measures to elicit (sometimes subtle) differences among devices in precision pointing tasks. the measures are target re-entry, task axis crossing, movement direction change, orthogonal direction change, movement variability, movement error, and movement offset. unlike movement time, error rate, and throughput, which are based on a single measurement per trial, the new measures capture aspects of movement behaviour during a trial. the theoretical basis and computational techniques for the measures are described, with examples given. an evaluation with four pointing devices was conducted to validate the measures. a causal relationship to pointing device efficiency (viz. throughput) was found, as was an ability to discriminate among devices in situations where differences did not otherwise appear. implications for pointing device research are discussed.  i. scott mackenzie tatu kauppinen miika silfverberg
retrieving documents by plausible inference: a priliminary study  choosing an appropriate document representation and search strategy for document retrieval has been largely guided by achieving good average performance instead of optimizing the results for each individual query. a model of retrieval based on plausible inference gives us a different perspective and suggests that techniques should be found for combining multiple sources of evidence (or search strategies) into an overall assessment of a document's relevance, rather than attempting to pick a single strategy. in this paper, we explain our approach to plausible inference for retrieval and describe some preliminary experiments designed to test this approach. the experiments use a spreading activation search to implement the plausible inference process. the results show that significant effectiveness improvements are possible using this approach.  w. b. croft t. j. lucia p. r. cohen
evaluation of eye gaze interaction  eye gaze interaction can provide a convenient and natural addition to user- computer dialogues. we have previously reported on our interaction techniques using eye gaze [10]. while our techniques seemed useful in demonstration, we now investigate their strengths and weaknesses in a controlled setting. in this paper, we present two experiments that compare an interaction technique we developed for object selection based on a where a person is looking with the most commonly used selection method using a mouse. we find that our eye gaze interaction technique is faster than selection with a mouse. the results show that our algorithm, which makes use of knowledge about how the eyes behave, preserves the natural quickness of the eye. eye gaze interaction is a reasonable addition to computer interaction and is convenient in situations where it is important to use the hands for other tasks. it is particularly beneficial for the larger screen workspaces and virtual environments of the future, and it will become increasingly practical as eye tracker technology matures.  linda e. sibert robert j. k. jacob
searching the web  we offer an overview of current web search engine design. after introducing a generic search engine architecture, we examine each engine component in turn. we cover crawling, local web page storage, indexing, and the use of link analysis for boosting search performance. the most common design and implementation techniques for each of these components are presented. for this presentation we draw from the literature and from our own experimental search engine testbed. emphasis is on introducing the fundamental concepts and the results of several performance analyses we conducted to compare different designs.
getting it across: layout issues for kiosk systems a clear and appealing screen layout is crucial to the success of on-line kiosk systems, public terminals that are connected to a network. this paper addresses the problem of developing such a layout, and provides several guidelines, drawn from traditional typography and gestalt psychology as well as from hypertext authoring, and human-computer interaction. to identify how a kiosk system's primary task influences optimal layout, kiosk systems are classified into four basic types. the usability of html (hypertext markup language) 2.0 and 3.0 to write documents for these systems is discussed, and some alternative existing environments are presented. jan borchers oliver deussen clemens knörzer
optimizing object queries using an effective calculus  object-oriented databases (oodbs) provide powerful data abstractions and modeling facilities, but they generally lack a suitable framework for query processing and optimization. the development of an effective query optimizer is one of the key factors for oodb systems to successfully compete with relational systems, as well as to meet the performance requirements of many nontraditional applications. we propose an effective framework with a solid theoretical basis for optimizing oodb query languages. our calculus, called the monoid comprehension calculus, captures most features of odmg oql, and is a good basis for expressing various optimization algorithms concisely. this article concentrates on query unnesting (also known as query decorrelation), an optimization that, even though it improves performance considerably, is not treated properly (if at all) by most oodb systems. our framework generalizes many unnesting techniques proposed recently in the literature, and is capable of removing any form of query nesting using a very simple and efficient algorithm. the simplicity of our method is due to the use of the monoid comprehension calculus as an intermediate form for oodb queries. the monoid comprehension calculus treats operations over multiple collection types, aggregates, and quantifiers in a similar way, resulting in a uniform method of unnesting queries, regardless of their type of nesting.
helping cscw applications succeed: the role of mediators in the context of use  this study found that the use of a computer conferencing system in an r&amp;d; lab was significantly shaped by a set of intervening actors--- mediators---who actively guided and manipulated the technology and its use over time. these mediators adapted the technology to its initial context and shaped user interaction with it; over time, they continued to modify the technology and influence use patterns to respond to changing circumstances. we argue that well-managed mediation may be a useful mechanism for shaping technologies to evolving contexts of use, and that it extends our understanding of the powerful role that intervenors can play in helping cscw applications succeed.  kazuo okamura wanda j. orlikowski masayo fujimoto joanne yates
of crawlers, portals, mice, and men: is there more to mining the web?  the world wide web is rapidly emerging as an important medium for transacting commerce as well as for the dissemination of information related to a wide range of topics (e.g., business, government, recreation). according to most predictions, the majority of human information will be available on the web in ten years. these huge amounts of data raise a grand challenge for the database community, namely, how to turn the web into a more useful information utility. this is exactly the subject that will be addressed by this panel.  minos n. garofalakis sridhar ramaswamy rajeev rastogi kyuseok shim
internet-based groupware for user participation in product development the workshop on internet-based groupware for user participation in product development (igroup) was held on november 14, 1998, in conjunction with the conferences cscw 98 and pdc 98 in seattle, wa, usa. the workshop gathered 16 participants from both academia and industry. the topic discussed was how we can use groupware technology to involve end-users in the development of software and non-software products.the context for product development has traditionally been separated from the users' work context (grudin 1991). in a product development process the user group is often unknown. products are often purchased off-the-shelf, and the developers can in most cases only guess which user community and what types of users will be using their products. the only source of user feedback in these situations is from laboratory experiments with "typical users," and in some occasions from product resellers. the result is often sub-optimal solutions.in the recent years this picture has changed drastically. technical innovations, in particular the internet, have made it possible to bring closer together product developers and end-users. in its beginning, the developers started using a "feedback button" as a menu choice in their programs. pushing this button would let the user compose a "complaint" message and send it to the developer. lately, more advanced methods have emerged, trying to construct mixed communities of end- users and developers, where one of the aims is to deliver products users really want.in this workshop, we took a look at how groupware is or could be used to facilitate collaboration between users and developers in order to increase the quality of the product. ten position papers discussed different aspects of user involvement using groupware technology. in this report we will first give a summary of the position papers and then discuss the areas that we saw as important for further investigation. monica divitini babak a. farshchian tuomo tuikka
computer-assisted evaluation of interface designs research in human-computer interaction has resulted in the development of task-theoretic analytical models that allow interface designers to evaluate the interface design on paper before building a prototype. despite the potential of such models to reduce interface development costs and improve design quality, they are not widely used. we believe that the complexity of these models is the main impediment and propose a computer system to remove this obstacle. the proposed system enables interface designers to describe an interface design formally and then assess it in terms of usability dimensions such as ease of learning and ease of use. it facilitates and structures task analysis and spares designers the burden of learning the complex syntax of analytical models. this paper describes the proposed system and discusses an empirical study designed to evaluate it. the empirical results show that the proposed system improves the accuracy and speed of evaluation of interface designs and contributes to more favorable attitudes towards analytical models. mohamed khalifa
a review of recent work on multi-attribute access methods  most database systems provide database designers with single attribute indexing capability via some form of b+tree. multi-attribute search structures are rare, and are mostly found in systems specialized to some more narrow application area, e.g. geographic databases. the reason is that no multi- attirbute search structure has been demonstrated, with high confidence. multi- attribute search is an active area of research. this paper reviews the state of this field and some of the difficult problems, and reviews some recent notable papers.  david lomet
from electronic whiteboards to distributed meetings (video program)(abstract only): extending the scope of dolphin  this video demonstrates different aspects of the dolphin cooperative hypermedia environment in the context of electroic meeting rooms. there are three parts. first, the basic funtionality of dolphin for electronic whiteboards is demonstrated. this includes the pen-based user-interface for creating informal structures such as scribbling, freehand sketching, and the creation of nodes and links. interaction for frequently used operations is based on gesture-recognition. second, it shows how dolphin supports different aspects of meetings including the processes in the pre-, in-, and post-meeting phases. during the meeting, participants can use computers mounted in the meeting room table. thus, everybody can access and modify information on the public space displayed on the whiteboard while sitting at the table. they can also engage in parallel private work which can be shared with the group later on. the third part demonstrates how dolphin can be used to support meetings between two groups on physically distributed meeting rooms. shared workspaces are complemented by audio/video connections between the rooms. it is noted that dolphin can also be used in distributed desktop-based situations.  ajit bapat jorg geibler david hicks norbert streitz daniel tietze
high-level programming features for improving the efficiency of a relational database system  this paper discusses some high-level language programming constructs that can be used to manipulate the relations of a relational database system efficiently. three different constructs are described: (1) tuple identifiers that directly reference tuples of a relation; (2) cursors that may iterate over the tuples of a relation; and (3) markings, a form of temporary relation consisting of a set of tuple identifiers. in each case, attention is given to syntactic, semantic, and implementation considerations.  the use of these features is first presented within the context of the programming language plain, and it is then shown how these features could be used more generally to provide database manipulation capabilities in a high- level programming language. consideration is also given to issues of programming methodology, with an important goal being the achievement of a balance between the enforcement of good programming practices and the ability to write efficient programs.  reind p. van de riet martin l. kersten wiebren de jonge anthony i. wasserman
new file organization based on dynamic hashing  new file organizations based on hashing and suitable for data whose volume may vary rapidly recently appeared in the literature. in the three schemes which have been independently proposed, rehashing is avoided, storage space is dynamically adjusted to the number of records actually stored, and there are no overflow records. two of these techniques employ an index to the data file. retrieval is fast and storage utilization is low.  in order to increase storage utilization, we introduce two schemes based on a similar idea and analyze the performance of the second scheme. both techniques use an index of much smaller size. in both schemes, overflow records are accepted. the price which has to be paid for the improvement in storage utilization is a slight access cost degradation.  michel scholl
the ergonomics of hypertext narative: usability testing as a tool for evaluation and redesign  while usability research concentrates on evaluating informational documents and web sites, significant insights can be gained from performingusability testing on texts designed for pleasure reading, such as hypertext narratives. this article describes the results of such a test. the results demonstrate that the navigation systems required for such texts can significantly interfere with readers ability to derive value or pleasure from the fiction. the results emphasize the importance of hypertext authors providing more linear paths through texts and of simplifying the navigational apparatus required to read them.
real-world interaction using the fieldmouse  we introduce an inexpensive position input device called the fieldmouse, with which a computer can tell the position of the device on paper or any flat surface without using special input tablets or position detection devices. a fieldmouse is a combination of an id recognizer like a barcode reader and a mouse which detects relative movement of the device. using a fieldmouse, a user first detects an id on paper by using the barcode reader, and then drags it from the id using the mouse. if the location of the id is known, the location of the dragged fieldmouse can also be calculated by adding the amount of movement from the id to the position of the fieldmouse. using a fieldmouse in this way, any flat surface can work as a pointing device that supports absolute position input, just by putting an id tag somewhere on the surface. a fieldmouse can also be used for enabling a graphical user interface (gui) on paper or on any flat surface by analyzing the direction and the amount of mouse movement after detecting an id. in this paper, we introduce how a fieldmouse can be used in various situations to enable computing in real-world environments.  itiro siio toshiyuki masui kentaro fukuchi
dynamat: a dynamic view management system for data warehouses  pre- computation and materialization of views with aggregate functions is a common technique in data warehouses. due to the complex structure of the warehouse and the different profiles of the users who submit queries, there is need for tools that will automate the selection and management of the materialized data. in this paper we present dynamat, a system that dynamically materializes information at multiple levels of granularity in order to match the demand (workload) but also takes into account the maintenance restrictions for the warehouse, such as down time to update the views and space availability. dynamat unifies the view selection and the view maintenance problems under a single framework using a novel "goodness" measure for the materialized views. dynamat constantly monitors incoming queries and materializes the best set of views subject to the space constraints. during updates, dynamat reconciles the current materialized view selection and refreshes the most beneficial subset of it within a given maintenance window. we compare dynamat against a system that is given all queries in advance and the pre-computed optimal static view selection. the comparison is made based on a new metric, the detailed cost savings ratio introduced for quantifying the benefits of view materialization against incoming queries. these experiments show that dynamat's dynamic view selection outperforms the optimal static view selection and thus, any sub-optimal static algorithm that has appeared in the literature.  yannis kotidis nick roussopoulos