waashk/acm huggingface dataset:
the design of the triton nested relational database system  unique database requirements of applications such as computer-aided design (cad), computer-aided software engineering(case), and office information systems(oic) have driven the development of new data models and database systems based on these new models. in particular, the goal of these new database systems is to exploit the advantages of complex data models that are more efficient (in terms of time and space) than their relational counterparts.  in this paper, we describe the design and implementation of the triton nested relational database system, a prototype system based on the nested relational data model. triton is intended to be used as the backend storage and access component of the aforementioned applications.  this paper describes the architecture of the triton system, and compares the performance of the nested relational model versus the relational model using triton. in addition, this paper evaluates the exodus extensible database toolkit used in the development of the triton system including key features of the persistent programming language e and the exodus storage manager.  tina m. harvey craig w. schnepf mark a. roth
the term retrieval abstract machine  scans through large collections of complex objects often cannot be avoided. even if sohphisticated indexing mechanisms are provided, it may be necessary to evaluate simple predicates against data stored on disk for filtering. for traditional record oriented data models i/o and buffer management are the main bottlenecks for this operation, the interpretation of data structures is straightforward and usually not an important cost factor. for heterogeneously shaped complex objects it may become a dominant cost factor.  in this paper we demonstrate a technique to make data structure traversal inside of complex objects much cheaper than naive interpretation. we compile navigation necessary to evaluate condition predicates and physical schema information into a program to be executed by a specialized abstract machine. our approach is demonstrated for the feature term data model (ftdm), but the technique is applicable to many other complex data models. main parts of this paper are dedicated to the method we used to design the term retrieval abstract machine (tram) architecture by partial evaluation of a tuned interpreter.  michael ley
supporting the writing of reports in a hierarchical organization in many hierarchical companies, reports from several independent groups must be merged to form a single, company-wide report. this paper describes a process and system for creating and structuring such reports and for propagating contributions up the organization. the system has been in regular use, in- house, by about 30 users for over a year to create monthly status reports. our experiences indicate that it is possible to change a monthly reporting practice so that the system is easy to use, improves the quality of the written report, fosters collaboration across projects and creates a corporate memory for the company. these results were achieved as a consequence of our design effort to directly support the hierarchical and collaborative process of creating and assembling the report within the organization. user feedback has led to many improvements in the usability and functionality of the system. further enhancements using information retrieval and text summarization techniques are in progress. andreas girgensohn
a general purpose data base design  one of the major problems facing data base designers is how to develop a logical data base design for a proposed application. usually, for each new application, a new data base design is produced. for a data base task group (dbtg) data base management system (dbms) this means creating a new schema and subschemas. this paper describes a non-volatile data base design that allows the dbtg structure of the data base to remain constant, regardless of changes in the applications it is portraying.  robert p. brazile
the crystal ball of research: how to use it to learn about the user community  with computing becoming more diverse and ubiquitous, it will be increasingly important in the future for user services departments to learn about the characteristics and needs of the people we serve. as a research psychologist working at yale's computer center, i have spent much of my time during the past year developing a research program to do just that. this paper will detail the development of the research agenda, describing the process involved, the program itself, and results we've obtained so far. i will end by offering suggestions on how other universities can develop their own user research programs.  susan grajek
comparing presentation summaries: slides vs. reading vs. listening  as more audio and video technical presentations go online, it becomes imperative to give users effective summarization and skimming tools so that they can find the presentation they want and browse through it quickly. in a previous study, we reported three automated methods for generating audio-video summaries and a user evaluation of those methods. an open question remained about how well various text/image only techniques will compare to the audio- video summarizations. this study attempts to fill that gap.  this paper reports a user study that compares four possible ways of allowing a user to skim a presentation: 1) powerpoint slides used by the speaker during the presentation, 2) the text transcript created by professional transcribers from the presentation, 3) the transcript with important points highlighted by the speaker, and 4) a audio-video summary created by the speaker. results show that although some text-only conditions can match the audio-video summary, users have a marginal preference for audio-video (anova f=3.067, p=0.087). furthermore, different styles of slide-authoring (e.g., detailed vs. big- points only) can have a big impact on their effectiveness as summaries, raising a dilemma for some speakers in authoring for on-demand previewing versus that for live audiences.  liwei he elizabeth sanocki anoop gupta jonathan grudin
overview of the virtual data center project and software  in this paper, we present an overview of the virtual data center (vdc) software, an open-source digital library system for the management and dissemination of distributed collections of quantitative data. (see ). the vdc functionality provides everything necessary to maintain and disseminate an individual collection of research studies, including facilities for the storage, archiving, cataloging, translation, and on-line analysis of a particular collection. moreover, the system provides extensive support for distributed and federated collections including: location-independent naming of objects, distributed authentication and access control, federated metadata harvesting, remote repository caching, and distributed virtual collections of remote objects.  micah altman l. andreev m. diggory g. king e. kolster a. sone s. verba daniel kiskis m. krot
visual metaphors for interacting with databases the need for better human- computer interaction (hci) has been widely recognized and discussed, even in the database area. it is generally accepted that the quality of the interaction mainly depends on the interface characteristics. how does one recognize "good" interfaces? the use of a suitable metaphor is crucial. unfortunately, to put it as a metaphor, speaking about metaphors in hci is like walking on a slippery floor.we would like to come up with a definition of metaphor that is specific to the particular needs of the database area, and, of course, of the database users. thus, we will highlight some peculiarities of the database interaction. the following considerations should constitute a basis towards a formal approach for the construction of effective metaphors for interacting with databases. tiziana catarci maria f. costabile maristella matera
cscw as a basis for interactive design semantics  the paper describes a method for visual systems synthesis. it stresses the importance of meaningful objects at the interface and suggests that semantics be used to derive such meaningful objects. the paper makes a distinction between the semantics of the design process and the problem domain and suggests that problem domain semantic concepts become the operands of design concepts. the paper notes the dual role of cscw both as a problem domain in its own right and as providing semantics to describe the design process itself. the paper defines a set of formal semantics for cscw and then describes synthesis of cscw systems. it then describes the design process and shows how cscw semantics can be used to define and implement a general model of the design process.  igor t. hawryszkiewycz
what is coordination theory and how can it help design cooperative work systems?  it is possible to design cooperative work tools based only on "common sense" and good intuitions. but the history of technology is replete with examples of good theories greatly aiding the development of useful technology. where, then, might we look for theories to help us design computer-supported cooperative work tools? in this paper, we will describe one possible perspective---the interdisciplinary study of coordination---that focuses, in part, on how people work together now and how they might do so differently with new information technologies.  in one sense, there is little that is new about the study of coordination. many different disciplines---including computer science, sociology, political science, management science, systems theory, economics, linguistics, and psychology---have all dealt, in one way or another, with fundamental questions about coordination. furthermore, several previous writers have suggested that theories about coordination are likely to be important for designing cooperative work tools (e.g., [holt88], [wino86]).  we hope to suggest here, however, that the potential for fruitful interdisciplinary connections concerning coordination is much greater than has as yet been widely appreciated. for instance, we believe that fundamentally similar coordination phenomena arise---unrecognized as such---in many of the fields listed above. though a single coherent body of theory about coordination does not yet exist, many different disciplines could both contribute to and benefit from more general theories of coordination. of particular interest to researchers in the field of computer-supported cooperative work is the prospect of drawing on a much richer body of existing and future work in these fields than has previously been suggested.  in this paper, we will first describe what we mean by "coordination theory" and give examples of how previous research on computer-supported cooperative work can be interpreted from this perspective. we will then suggest one way of developing this perspective further by proposing tentative definitions of coordination and analyzing its components in more detail.  thomas w. malone kevin crowston
starts: stanford proposal for internet meta-searching  document sources are available everywhere, both within the internal networks of organizations and on the internet. even individual organizations use search engines from different vendors to index their internal document collections. these search engines are typically incompatible in that they support different query models and interfaces, they do not return enough information with the query results for adequate merging of the results, and finally, in that they do not export metadata about the collections that they index (e.g., to assist in resource discovery). this paper describes starts, an emerging protocol for internet retrieval and search that facilitates the task of querying multiple document sources. starts has been developed in a unique way. it is not a standard, but a group effort coordinated by stanford's digital library project, and involving over 11 companies and organizations. the objective of this paper is not only to give an overview of the starts protocol proposal, but also to discuss the process that led to its definition.  luis gravano chen-chuan k. chang hector garcia-molina andreas paepcke
a multimedia synchronization model described by boolean expressions  in this paper, a multimedia synchronization model is proposed. the purpose of this model is description for temporal relationships(i.e. time ordering and synchronization for multimedia presentation) among various media. in the model, user interactions, such as conditional branching and menu selection, are also considered. for the description of the temporal relationships, boolean expressions are used. the concept of media objects would be a great help to manipulate multimedia data. the functions of the media objects are defined in this paper. a media object is an entity that contains associated data and a media variable representing its presentation state. various types of media are classified into two types: output and input media objects. output media objects have data perceived by the user such as graphics, image, drawings, animation, audio and video. input media objects such as buttons and menus can handle input from the user.  temporal relationships among media objects can be represented by a set of presentation expressions consisting of a boolean expression; three logical operators(and, or, and not) and media variables. the value of the media variable indicates the state of media(e.g., in the case of video object, it has two states; playing and not playing.) furthermore, by describing temporal relationships between input media objects and output media objects, user interaction can be successfully described in our model.  a multimedia animal guide system, prototype system base on the model, was implemented. the system can synchronously present the media such as video, audio, image, and text, and can explain the feature and characteristics of animals, and the sequence of the presentation can be controlled by the user.  tatsuo sato joung- hoon lim ken-ichi okada yutaka matsushita
how to roll a join: asynchronous incremental view maintenance  incremental refresh of a materialized join view is often less expensive than a full, non-incremental refresh. however, it is still a potentially costly atomic operation. this paper presents an algorithm that performs incremental view maintenance as a series of small, asynchronous steps. the size of each step can be controlled to limit contention between the refresh process and concurrent operations that access the materialized view or the underlying relations. the algorithm supports point-in-time refresh, which allows a materialized view to be refreshed to any time between the last refresh and the present.  kenneth salem kevin beyer bruce lindsay roberta cochrane
performance evaluation of ephemeral logging  ephemeral logging (el) is a new technique for managing a log of database activity on disk. it 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 highly concurrent databases and applications which have a wide distribution of transaction lifetimes.  this paper briefly explains el and then analyzes its performance. simulation studies indicate that it 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 implies much faster recovery after a crash as well as cost savings.  el is the method of choice in some but not all situations. we assess the limitations of our current knowledge about el and suggest promising directions for further research.  john s. keen william j. dally
progressive quantized projection watermarking scheme  in this paper we present a new watermarking technique for digital images. our approach modifies blocks of the image after projecting them onto certain directions. by quantizing the projected blocks to even and odd values we can represent the hidden information properly. the proposed algorithm does the modification progressively to ensure successful data extraction without any prior information being sent to the receiver side. in order to increase the robustness of our watermark to scaling and rotation attacks we also present a solution to recover the original size and orientation based on a training sequence which is inserted as part of the watermark.  masoud alghoniemy ahmed h. tewfik
random and best-first document selection models  most document retrieval systems based on probabilistic models of feature distributions assume random selection of documents for retrieval. the assumptions of these models are met when documents are randomly selected from the database or when retrieving all available documents. a more suitable model for retrieval of a single document assumes that the best document available is to be retrieved first. models of document retrieval systems assuming random selection and best-first selection are developed and compared under binary independence and two poisson independence feature distribution models. under the best-first model, feature discrimination varies with the number of documents in each relevance class in the database. a weight similar to the inverse document frequency weight and consistent with the best-first model is suggested which does not depend on knowledge of the characteristics of relevant documents.  r. losee
pardes - an enhanced active database system (abstract)  traditional databases are passive. they do only what isexplicitly requested in the user's query or update operation. theactive database paradigm states that a database may react in anintelligent way to an external input by creating and executingdatabase operations, which, though not explicitly requested in theinput, are required to preserve invariants associated to the database.  this paradigm replaces many operations traditionally implementedby application programs with descriptive definitions that are partof the database schema. models and research prototypes based onthis paradigm are post-gres, hipac, sapiens, ariel.  our model extends existing active database models in thefollowing ways:    * it increases the expressive-power of the language used todefine the database schema by allowing the specification of aricher class of invariants than is currently supported. example:(salary:=base-salary + bonus + 1000* count(subordinates)) the proposed language is compact yet powerful. itreduces the cost of development and maintenance of database updateapplications and reduces the problems of validation andverification.   * it provides an efficient algorithm for generating the auxiliaryoperations required to preserve the invariants after an update (inother models these operations have to be explicitly coded, eitherin the application program or in the database schema.)   * our model introduces the notion of exception-handling mode,proposes a number of such modes, and specifies how modes can bedefined in the data base schema. the modes we propose eliminate alarge portion of the exception handling code that currently existsin application programs.  opher etzion
how can cooperative work tools support dynamic group process? bridging the specificity frontier  in the past, most collaboration support systems have focused on either automating fixed work processes or simply supporting communication in ad-hoc processes. this results in systems that are usually inflexible and difficult to change or that provide no specific support to help users decide what to do next.  this paper describes a new kind of tool that bridges the gap between these two approaches by flexibly supporting processes at many points along the spectrum: from highly specified to highly unspecified. the development of this approach was strongly based on social science theory about collaborative work.  abraham bernstein
a progressive view materialization algorithm  a data warehouse stores materialized views of aggregate data derived from a fact table in order to minimize the query response time. one of the most important decisions in designing the data warehouse is the selection of materialized views. this paper presents an algorithm which provides appropriate views to be materialized while the goal is to minimize the query response time and maintenance cost. we use a data cube lattice, frequency of queries and updates on views, and view size to select views to be materialized using greedy algorithms. in spite of the simplicity, our algorithm selects views which give us better performance than views that selected by existing algorithms.  hidetoshi uchiyama kanda runapongsa toby j. teorey
processor allocation strategies for multiprocessor database machines  in this paper four alternative strategies for assigning processors to queries in multiprocessor database machines are described and evaluated. the results demonstrate that simd database machines are indeed a poor design when their performance is compared with that of the three mimd strategies presented.  also introduced is the application of data-flow machine techniques to the processing of relational algebra queries. a strategy that employs data-flow techniques is shown to be superior to the other strategies described by several experiments. furthermore, if the data-flow query processing strategy is employed, the results indicate that a two-level storage hierarchy (in which relations are paged between a shared data cache and mass storage) does not have a significant impact on performance.  haran boral david j. dewitt
empirically validated web page design metrics  a quantitative analysis of a large collection of expert-rated web sites reveals that page-level metrics can accurately predict if a site will be highly rated. the analysis also provides empirical evidence that important metrics, including page composition, page formatting, and overall page characteristics, differ among web site categories such as education, community, living, and finance. these results provide an empirical foundation for web site design guidelines and also suggest which metrics can be most important for evaluation via user studies.  melody y. ivory rashmi r. sinha marti a. hearst
unary inclusion dependencies have polynomial time inference problems  we study the interaction between unary inclusion dependencies (uind's) and other known classes of dependencies, in the context of both unrestricted and finite implication. we provide complete axiomatizations for unrestricted and finite implication of uind's and functional dependencies, and polynomial-time algorithms for the inference problems. the inference problem becomes, however, np-hard, if we require that some attribute have a bounded domain. we show that for unrestricted implication, the interaction between uind's and unary functional dependencies completely characterizes the interaction between uind's and embedded implicational dependencies. also, for finite implication, the interaction between uind's and unary functional dependencies completely characterizes the interaction between uind's and full implicational dependencies (but not uind's and embedded implicational dependencies).  paris c. kanellakis stavros s. cosmadakis moshe y. vardi
data warehousing and olap for decision support  on-line analytical processing (olap) and data warehousing are decision support technologies. their goal is to enable enterprises to gain competitive advantage by exploiting the ever-growing amount of data that is collected and stored in corporate databases and files for better and faster decision making. over the past few years, these technologies have experienced explosive growth, both in the number of products and services offered, and in the extent of coverage in the trade press. vendors, including all database companies, are paying increasing attention to all aspects of decision support.  surajit chaudhuri umeshwar dayal