waashk/acm huggingface dataset:
traversal recursion: a practical approach to supporting recursive applications  many capabilities that are needed for recursive applications in engineering and project management are not well supported by the usual formulations of recursion. we identify a class of recursions called "traversal recursions" (which model traversals of a directed graph) that have two important properties they can supply the necessary capabilities and efficient processing algorithms have been defined for them. first we present a taxonomy of traversal recursions based on properties of the recursion on graph structure and on unusual types of metadata. this taxonomy is exploited to identify solvable recursions and to select an execution algorithm. we show how graph traversal can sometimes outperform the more general iteration algorithm. finally we show how a conventional query optimizer architecture can be extended to handle recursive queries and views.  arnon rosenthal sandra heiler umeshwar dayal frank manola
are we working on the right problems? (panel)  there appears to be a discrepancy between the research topics being pursued by the database research community and the key problems facing information systems decisions makers such as chief information officers (cios). panelists will present their view of the key problems that would benefit from a research focus in the database research community and will discuss perceived discrepancies. based on personal experience, the most commonly discussed information systems problems facing cios today include:  michael stonebraker
database research at at&amp;t; bell laboratories  bell laboratories is the research and development arm of at&amp;t.; there is today tremendous support for database research in bell labs and in at&amp;t.; this is expected to continue since database technology is recognized as being central not just to teradata, ncr, and at&amp;t;'s computing business but to its core communication business as well. what you see described below is a survey of the current state of a young and growing research effort in the database area. you should expect to see a stronger "resume" a few years down the road.  research at at&amp;t; bell labs is never directed from above, towards specific projects or objectives. individual researchers select their areas of research based on a combination of factors that include individual skill and interest, other on-going activity and potential for collaboration, and the likelihood of intellectual or monetary impact. while research activity can range from the highly theoretical to the completely applied, it is expected that most research be performed within the framework of some larger objective; and this framework is typically provided by a prototype system.  in addition to the core set of people here full-time, often there are visitors. you will see the names of many of these in the publications listed. for instance, most recently oded shmueli from the technion spent a year with us. currently, avi silberschatz is visiting from austin.  h. v. jagadish
ontology-based web site mapping for information exploration  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 naive-bayes approach. we found that the vector space approach produces better accuracy in ontology- based web site mapping.  xiaolan zhu susan gauch lutz gerhard nicholas kral alexander pretschner
informedia digital video library  the informedia digital video library project is developing new technologies for creating full-content search and retrieval digital video libraries. working in collaboration with wqed pittsburgh, the project is creating a testbed that will enable k-12 students to access, explore, and retrieve science and mathematics materials from the digital video library. the library will initially contain 1,000 hours of video from the archives of project partners: wqed, fairfax co. va schools' electronic bbc-produced video courses. (industrial partners include digital equipment corp., bell atlantic, intel corp., and microsoft, inc.) this library will be installed at winchester thurston school, an independent k-12 school in pittsburgh.  m. christel t. kanade m. mauldin r. reddy m. sirbu s. stevens h. wactlar
meta-design: design for designers  one fundamental challenge for the design of the interactive systems of the future is to invent and design environments and cultures in which humans can express themselves and engage in personally meaningful activities. unfortunately, a large number of new media are designed from a perspective of viewing and treating humans primarily as consumers. the possibility for humans to be and act as designers (in cases in which they desire to do so) should be accessible not only to a small group of high-tech scribes, but rather to all interested individuals and groups. meta- design characterizes activities, processes, and objectives to create new media and environments that allow users to act as designers and be creative.  in this paper we discuss problems addressed by our research on meta-design, provide a conceptual framework for meta-design, and illustrate our developments in the context of a particular system, the envisionment and discovery collaboratory.  gerhard fischer eric scharff
xmas: an extensible main-memory storage system for high-performance applications  xmas is an extensible main-memory storage system for high-performance embedded database applications. xmas not only provides the core functionality of dbms, such as data persistence, crash recovery, and concurrency control, but also pursues an extensible architecture to meet the requirements from various application areas. one crucial aspect of such extensibility is that an application developer can compose application- specific, high-level operations with a basic set of operations provided by the system. called composite actions in xmas, these operations are processed by a customized xmas server with minimum interaction with application processes, thus improving the overall performance. this paper first presents the architecture and functionality of xmas, and then demonstrates a simulation of mobile communication service.  jang ho park yong sik kwon ki hong kim sang ho lee byoung dae park sang kyun cha
indexing the positions of continuously moving objectsthe coming years will witness dramatic advances in wireless communications aswell as positioning technologies. as a result, tracking the changing positionsof objects capable of continuous movement is becoming increasingly feasibleand necessary. the present paper proposes a novel, r*-tree based indexingtechnique that supports the efficient querying of the current and projectedfuture positions of such moving objects. the technique is capable of indexingobjects moving in one-, two-, and three-dimensional space. update algorithmsenable the index to accommodate a dynamic data set, where objects may appearand disappear, and where changes occur in the anticipated positions ofexisting objects. a comprehensive performance study is reported.simonas Å altenis christian s. jensen scott t. leutenegger mario a. lopez
how do the experts do it? the use of ethnographic methods as an aid to understanding the cognitive processing and retrieval of large bodies of text  this paper explores an important problem in information retrieval: that of rapidly increasing amounts of full-text storage that is difficult to file and retrieve effectively. the author suggests that a possible avenue for improving full-text retrieval would include in-depth studies of the ways in which individual users cope with large amounts of written information, stored chiefly on paper in their offices. relevant literature in cognitive psychology is reviewed and some recent and continuing studies are described that have used anthropological methods to approach this problem. it is argued that historians are a good group to study, due to their reliance on the examination and processing of texts, and the broad scope of their inquiries. examinations of the ways in which this one group of information workers categorize documents could lead us to a better understanding of human problems in processing and retrieving textual information.  d. o. case
ariadne: a system for constructing mediators for internet sources  the web is based on a browsing paradigm that makes it difficult to retrieve and integrate data from multiple sites. today, the only way to achieve this integration is by building specialized applications, which are time-consuming to develop and difficult to maintain. we are addressing this problem by creating the technology and tools for rapidly constructing information mediators that extract, query, and integrate data from web sources. the resulting system, called ariadne, makes it feasible to rapidly build information mediators that access existing web sources.  jose luis ambite naveen ashish greg barish craig a. knoblock steven minton pragnesh j. modi ion muslea andrew philpot sheila tejada
tivoli: an electronic whiteboard for informal workgroup meetings  this paper describes tivoli, an electronic whiteboard application designed to support informal workgroup meetings and targeted to run on the xerox liveboard, a large screen, pen-based interactive display. tivoli strives to provide its users with the simplicity, facile use, and easily understood functionality of conventional whiteboards, while at the same time taking advantage of the computational power of the liveboard to support and augment its users' informal meeting practices. the paper presents the motivations for the design of tivoli and briefly describes the current version in operation. it then reflects on several issues encountered in designing tivoli, including the need to reconsider the basic assumptions behind the standard desktop gui, the use of strokes as the fundamental object in the system, the generalized wipe interface technique, and the use of meta-strokes as gestural commands.  elin rønby pedersen kim mccall thomas p. moran frank g. halasz
a methodology for objectively evaluating error messages  message quality is a critical factor in influencing user acceptance of a program product. good error messages can reduce the time and cost to create and maintain software, as well as help users learn about the product. we have developed a methodology for conducting controlled usability evaluations of error messages. the message test program is easily modified to adapt to different product situations, and messages can be evaluated even before working code exists. the message test program can be used to test error messages for a batch product, as well as messages for an interactive product. it can also be used for stand-alone messages, for products that offer on-line help, or messages that provide additional information in a reference manual. message testing enables us to objectively evaluate error messages and provide specific feedback about the difficulties users encounter and how error messages can be improved.  barbara s. isa james m. boyle alan s. neal roger m. simons
a normal form for precisely characterizing redundancy in nested relations  we give a straightforward definition for redundancy in individual nested relations and define a new normal form that precisely characterizes redundancy for nested relations. we base our definition of redundancy on an arbitrary set of functional and multivalued dependencies, and show that our definition of nested normal form generalizes standard relational normalization theory. in addition, we give a condition that can prevent an unwanted structural anomaly in nested relations, namely, embedded nested relations with at most one tuple. like other normal forms, our nested normal form can serve as a guide for database design.  wai yin mok yiu-kai ng david w. embley
creating creativity: user interfaces for supporting innovation  a challenge for human-computer interaction researchers and user interf ace designers is to construct information technologies that support creativity. this ambitious goal can be attained by building on an adequate understanding of creative processes. this article offers a four-phase framework for creativity that might assist designers in providing effective tools for users: (1)collect: learn from provious works stored in libraries, the web, etc.; (2) relate: consult with peers and mentors at early, middle, and late stages, (3)create: explore, compose, evaluate possible solutions; and (4) donate: disseminate the results and contribute to the libraries. within this integrated framework, this article proposes eight activities that require human-computer interaction research and advanced user interface design. a scenario about an architect illustrates the process of creative work within such an environment.  ben shneiderman
the multidimensional database system rasdaman  rasdaman is a universal \--- i.e., domain-independent --- array dbms for multidimensional arrays of arbitrary size and structure. a declarative, sql- based array query language offers flexible retrieval and manipulation. efficient server-based query evaluation is enabled by an intelligent optimizer and a streamlined storage architecture based on flexible array tiling and compression.  rasdaman is being used in several international projects for the management of geo and healthcare data of various dimensionality.  p. baumann a. dehmel p. furtado r. ritsch n. widmann
rosolving conflicts in global storage design through replication  we present a conceptual framework in which a database's intra- and interrecord set access requirements are specified as a constrained assignment of abstract characteristics ("evaluated," "indexed," "clustered," "well-placed") to logical access paths. we derive a physical schema by choosing an available storage structure that most closely provides the desired access characteristics. we use explicit replication of schema objects to reduce the access cost along certain paths, and analyze the trade-offs between increased update overhead and improved retrieval access. finally, we given an algorithm to select storage structures for a codasyl 78 dbtg schema, given its access requirements specification.  r. h. katz e. wong
reachability and connectivity queries in constraint databases  it is known that standard query languages for constraint databases lack the power to express connectivity properties. such properties are important in the context of geographical databases, where one naturally wishes to ask queries about connectivity (what are the connected components of a given set?) or reachability (is there a path from a to b that lies entirely in a given region?). no existing constraint query languages that allow closed form evaluation can express these properties.  in the first part of the paper, we show that in principle there is no obstacle to getting closed languages that can express connectivity and reachability queries. in fact, we show that adding any topological property to standard languages like fo + lin and fo+poly results in a closed language. in the second part of the paper, we look for tractable closed languages for expressing reachability and connectivity queries. we introduce path logic, which allows one to state properties of paths with respect to given regions. we show that it is closed, has polynomial time data complexity for linear and polynomial constraints, and can express a large number of reachability properties beyond simple connectivity. query evaluation in the logic involves obtaining a discrete abstraction of a continuous path, and model-checking of temporal formulae on the discrete structure.  michael benedikt martin grohe leonid libkin luc segoufin
the organization of cooperative work: beyond the "leviathan" conception of the organization of cooperative work  this paper examines the relationship between cooperative work and the wider organizational context. the purpose of the exploration is not to contribute to organizational theory in general, but to critique the transaction cost approach to organizational theory from the point of view of cooperative work. the paper posits that the formal conception of organization---organization conceived of in terms of "common ownership"\---is inadequate as a conceptual foundation for embedding cscw systems in a wider organizational context. the design of cscw systems for real-world application must move beyond the bounds of organizational forms conceived of in terms of "common ownership."  kjeld schmidt
principles, techniques, and ethics of stage magic and their application to human interface design  magicians have been designing and presenting illusions for 5000 years. they have developed principles, techniques and ethical positions for their craft that this paper argues are applicable to the design of human/computer interfaces. the author presents a number of specific examples from magic and discusses their counterparts in human interface design, in hopes that human interface practitioners and researchers will, having recognized the applicability of magic, go further on their own to explore its domain.  bruce tognazzini
first-class views: a key to user-centered computing  large database systems (e.g., federations, warehouses) are multi- layer \\--- i.e., a combination of base databases and (virtual or physical) view databases1. smaller systems use views for layers that hide detailed physical and conceptual structures. we argue that most databases would be more effective if they were more user-centered \\--- i.e., if they allowed users, administrators, and application developers to work mostly within their native view. to do so, we need first class views \\--- views that support most of the metadata and operations available on source tables.  first class views could also make multi-tier object architectures (based on objects in multiple tiers of servers) easier to build and maintain. the views modularize code for data services (e.g., query, security) and for coordinating changes with neighboring tiers. when data in each tier is derived declaratively, one can generate some of these methods semi-automatically.  much of the functionality required to support first class views can be generated semi- automatically, if the derivations between layers are declarative (e.g., sql, rather than java). we present a framework where propagation rules can be defined, allowing the flexible and incremental specification of view semantics, even by non-programmers. finally, we describe research areas opened up by this approach.  arnon rosenthal edward sciore
user perceptual mechanisms in the search of computer command menus  menu-based command systems, in which a user selects a command from a set of choices displayed to him, have acquired widespread use as a human- computer interface technique. the technique is especially attractive for use with new or untrained users since the user need not recall the command he wishes, but merely recognize it. but menu systems also find application in more sophisticated systems meant for expert users (for example, teitelman, 1977) where they can be used to reduce the complexity of the options with which the user is presented.  stuart k. card
a pattern matching language for spatio-temporal databases  we propose a pattern matching language for spatio-temporal databases. the matching process in time dimension is based upon the evolutionary nature of time, but in spatial dimension it is based on placement, shape and sizes of regions. the concept of pattern matching introduced in this paper is independent of the choice of the underlying model for spatio-temporal databases. in particular, the pattern matching language seamlessly extends our sql-like query language parasql for spatio-temporal databases. the pattern matching language would also have application in active databases, because patterns can be used as triggers.  tsz s. cheng shashi k. gadia
information sought and information provided: an empirical study of user/expert dialogues  transcripts of computer-mail users seeking advice from an expert were studied to investigate the complementary claims that people often do not know what information they need to obtain in order to achieve their goals, and consequently, that experts must identify inappropriate queries and infer and respond to the goals behind them. this paper reports on one facet of the transcript analysis, namely, the identification of the types of relation that hold between the action that an advice-seeker asks about and the action that an expert tells him how to perform. three such relations between actions are identified: generates, enables, and is-alternative-to. the claim is made that a cooperative advice-providing system, such as a help system or an expert system, must be able to compute these relations between actions.  martha e. pollack
task based groupware design: putting theory into practice  designing groupware systems requires methods and tools that cover all aspects of groupware systems. we present a method that utilizes known theoretical insights and makes them usable in practice. in our method, the design of groupware systems is driven by an extensive task analysis followed by structured design and iterative evaluation using usability criteria. using a combination of multiple complementary representations and techniques, a wide range of aspects of groupware design is covered. the method is built on our experiences and is used in practice by several companies and educational institutes in europe. we define the design process, the models needed and the tools that support the design process.  gerrit van der veer martijn van welie
design and selection of materialized views in a data warehousing environment: a case study  in this paper, we describe the design of a data warehousing system for an engineering company 'r'. a cost model was developed for this system to enable the evaluation of the total costs and benefits involved in selecting each materialized view. using the cost analysis methodology for evaluation, an adapted greedy algorithm has been implemented for the selection of materialized views. the algorithm and cost model were applied to a set of real-life database items extracted from company 'r'. by selecting the most cost effective set of materialized summary views, the total of the maintenance, storage and query costs of the system is optimized, thereby resulting in an efficient data warehousing system.  goretti k. y. chan qing li ling feng
the oasis multidatabase prototype  the oasis prototype is under development at dublin city university in ireland. we describe a multi-database architecture which uses the odmg model as a canonical model and describe an extention for construction of virtual schemas within the multidatabase system. the omg model is used to provide a standard distribution layer for data from local databases. this takes the form of corba objects representing export schemas from separate data sources.  mark roantree john murphy wilhelm hasselbring