waashk/acm huggingface dataset:
the role of expectations in human-computer interaction  this paper describes a pilot study on the role of expectations in human- computer interaction on a decision-making task. participants (n=70) were randomly assigned to one of 5 different computer partners or to a human partner. after completing the rankings for the desert survival task, participants engaged in a dialog with their computer or human partners. results revealed that interaction with human partners was more expected and more positively evaluated than interaction with computer agents. in addition, the addition of human-like qualities to computer interfaces did not increase expectedness or evaluations as predicted. correlation analysis for the five computer conditions demonstrated that expectations and evaluations do effect influence and perceptions of the partner. discussion focuses on ways to coordinate expectations, interface design, and task objectives.  joseph a. bonito judee k. burgoon bjorn bengtsson
west: a web browser for small terminals  we describe west, a web browser for small terminals, that aims to solve some of the problems associated with accessing web pages on hand-held devices. through a novel combination of text reduction and focus+context visualization, users can access web pages from a very limited display environment, since the system will provide an overview of the contents of a web page even when it is too large to be displayed in its entirety. to make maximum use of the limited resources available on a typical hand-held terminal, much of the most demanding work is done by a proxy server, allowing the terminal to concentrate on the task of providing responsive user interaction. the system makes use of some interaction concepts reminiscent of those defined in the wireless application protocol (wap), making it possible to utilize the techniques described here for wap-compliant devices and services that may become available in the near future.  staffan björk lars erik holmquist johan redström ivan bretan rolf danielsson jussi karlgren kristofer franzen
context and orientation in hypermedia networks  the core of hypermedia's power lies in the complex networks of links that can be created within and between documents. however, these networks frequently overwhelm the user and become a source of confusion. within intermedia, we have developed the web view-a tool for viewing and navigating such networks with a minimum of user confusion and disorientation. the key factors in the web view's success are a display that combines a record of the user's path through the network with a map of the currently available links; a scope line that summarizes the number of documents and links in the network; and a set of commands that permit the user to open documents directly from the web view.  kenneth utting nicole yankelovich
a featural approach to command names  a variety of aspects of command names have been studied, such as suggestiveness, memorability, and the use of icons. a single framework for these disparate studies is desirable, and it is proposed that the concept of featural analysis prevalent in linguistics and psycholinguistics be adopted as an approach to command name design. examples of the breadth of application of this approach are given for the naming issues of suggestiveness, learning and memory, congruence and hierarchicalness, universal commands, the relationships of names to the command language syntax, and the use of non-words as names.  jarrett rosenberg
office documents on a database kernel - filing, retrieval, and archiving  one of the main component of integrated office systems is the large central filing system. it efficiently stores, retrieves and searches office documents containing text, images, graphics, data and voice. we propose to implement a filing system on top of the darmstadt database system (dasdbs), which is designed as a data management kernel for both standard and non- standard applications. this paper investigates the choice of appropriate storage structures for the filing system objects and the realization of the system by using the kernel. furthermore we discuss the efficient retrieval support of office objects by signatures and introduce a new archival approach by using storage media like optical disks.  p. zabback h. b. paul u. deppisch
a dynamic cluster maintenance system for information retrieval  partitioning by clustering of very large databases is a necessity to reduce the space/time complexity of retrieval operations. however, the contemporary and modern retrieval environments demand dynamic maintenance of clusters. a new cluster maintenance strategy is proposed and its similarity/stability characteristics, cost analysis, and retrieval behavior in comparison with unclustered and completely reclustered database environments have been examined by means of a series of experiments.  f. can e. ozkarahan
efficient resumption of interrupted warehouse loads  data warehouses collect large quantities of data from distributed sources into a single repository. a typical load to create or maintain a warehouse processes gbs of data, takes hours or even days to execute, and involves many complex and user- defined transformations of the data (e.g., find duplicates, resolve data inconsistencies, and add unique keys). if the load fails, a possible approach is to "redo" the entire load. a better approach is to resume the incomplete load from where it was interrupted. unfortunately, traditional algorithms for resuming the load either impose unacceptable overhead during normal operation, or rely on the specifics of transformations. we develop a resumption algorithm called _dr_ that imposes no overhead and relies only on the high-level properties of the transformations. we show that _dr_ can lead to a ten-fold reduction in resumption time by performing experiments using commercial software.  wilburt juan labio janet l. wiener hector garcia-molina vlad gorelik
database concurrency control using data flow graphs  a specialized data flow graph, database flow graph (dbfg) is introduced. dbfgs may be used for scheduling database operations, particularly in an mimd database machine environment. a dbfg explicitly maintains intertransaction and intratransaction dependencies, and is constructed from the transaction flow graphs (tfg) of active transactions. a tfg, in turn, is the generalization of a query tree used, for example, in direct [15].  all dbfg schedules are serializable and deadlock free. operations needed to create and maintain the dbfg structure as transactions are added or removed from the system are discussed. simulation results show that dbfg scheduling performs as well as two-phase locking.  m. h. eich david l. wells
hierarchical schemata for relational databases  most database design methods for the relational model produce a flat database, that is, a family of relations with no explicit interrelational connections. the user of a flat database is likely to be unaware of certain interrelational semantics. in contrast, the entity-relationship model provides schema graphs as a description of the database, as well as for navigating the database. nevertheless, the user of an entity-relationship database may still commit semantic errors, such as performing a lossy join. this paper proposes a nonflat, or hierarchical, view of relational databases. relations are grouped together to form relation hierarchies in which lossless joins are explicitly shown whereas lossy joins are excluded. relation hierarchies resemble the schema graphs in the entity-relationship model.  an approach to the design of relation hierarchies is outlined in the context of data dependencies and relational decomposition. the approach consists of two steps; each is described as an algorithm. algorithm dec decomposes a given universal relation according to a given set of data dependencies and produces a set of nondecomposable relation schemes. this algorithm differs from its predecessors in that it produces no redundant relation schemes. algorithm rh further structures the relation schemes produced by algorithm dec into a hierarchical schema. these algorithms can be useful software tools for database designers.  y. edmund lien
designing organizational interfaces  this paper argues that it will become increasingly important to extend our concept of user interfaces for individual users of computers to include organizational interfaces for groups of users. a number of suggestions are given for how to develop a theoretical base for designing such interfaces. for instance, examples are used to illustrate how traditional cognitive points of view can be extended to include information processing by multiple agents in organizations. examples of design implications from other perspectives such as motivational, economic, and political are also included.  thomas w. malone
answering queries on embedded-complete database schemes  it has been observed that, for some database schemes, users may have difficulties retrieving correct information, even for simple queries. the problem occurs when some implicit "piece" of information, defined on some subset of a relation scheme, is not explicitly represented in the database state. in this situation, users may be required to know how the state and the constraints interact before they can retrieve the information correctly.  in this paper, the formal notion of embedded-completeness is proposed, and it is shown that schemes with this property avoid the problem described above. a polynomial-time algorithm is given to test whether a database scheme is independent and embedded-complete. under the assumption of independence, it is shown that embedded-complete schemes allow efficient computation of optimal relational algebra expressions equivalent to the x-total projection, for any set of attributes x.  edward p. f. chan alberto o. mendelzon
updating olap dimensions  olap systems support data analysis through a multidimensional data model, according to which data facts are viewed as points in a space of application- related "dimensions" , organized into levels which conform a hierarchy. although the usual assumption is that these points reflect the dynamic aspect of the data warehouse while dimensions are relatively static, in practice it turns out that dimension updates are often necessary to adapt the multidimensional database to changing requirements. these updates can take place either at the structural level (e.g. addition of categories or modification of the hierarchical structure) or at the instance level (elements can be inserted, deleted, merged, etc.). they are poorly supported (or not supported at all) in current commercial systems and have not been addressed in the literature. in a previous paper we introduced a formal model supporting dimension updates. here, we extend the model, adding a set of semantically meaningful operators which encapsulate common sequences of primitive dimension updates in a more efficient way. we also formally define two mappings (normalized and denormalized) from the multidimensional to the relational model, and compare an implementation of dimension updates using these two approaches.  carlos a. hurtado alberto o. mendelzon alejandro a. vaisman
elfs: english language from sql  in this paper we describe a system which, given a query in sql-like relational database language, will display its meaning in clear, unambiguous natural language. the syntax-driven translation mechanism is independent of the application domain. it has direct applications in designing computer-based sql tutorial systems and program debugging systems. the research results obtained in the paper will also be useful in query optimization and design of a more user-friendly language front-endfor casual users.  w. s. luk steve kloster
safe query languages for constraint databases  in the database framework of kanellakis et al. [1990] it was argued that constraint query languages should take constraint databases as input and give other constraint databases that use the same type of atomic constraints as output. this closed- form requirement has been difficult to realize in constraint query languages that contain the negation symbol. this paper describes a general approach to restricting constraint query languages with negation to safe subsets that contain only programs that are evaluable in closed-form on any valid constraint database input.  peter z. revesz
the distribution of granule accesses made by database transactions  the problem of characterizing the number of granules (or blocks) accessed by a transaction is important in modeling the performance of database management systems and other applications. different expressions for this quantity have appeared in the literature under different probabilistic assumptions. these expressions along with one new result are presented with a uniform notation and a clear statement of the assumptions underlying each. the partial order relating the predictions of the expected number of granules accessed is presented.  annie w. shum andrew m. langer
shared hardware: a novel technology for computer support of face to face meetings  this paper describes the capture lab, a computer supported meeting room in use at the eds center for machine intelligence since late 1987\. most computer supported meeting environments implement a simple hardware approach, where a single computer controlled by a trained technician or facilitator is used, or else adopt a groupware approach, where each user has a personal machine and special-purpose software is used to support group activities. in contrast, the capture lab implements a shared hardware approach, in which each meeting participant has a personal computer, but can easily access a shared public computer as well. we discuss the advantages and limitations of this approach, based on our observations of how the room is used, and compare it to the simple hardware and groupware approaches.  d. halonen m. horton r. kass p. scott
a high-level functional query language for a small relational system  in this paper we describe the design and implementation of a high- level query language fquery which applies the concepts of the functional data model to the retrieval of information from relational databases created on a small pdp-11 system by the riss relational system described in [me]. we describe the query language and the functional data model and discuss the benefits they provide for the casual user in expressing queries in a conceptually natural manner.  hoyt d. warner david odle
updates and view maintenance in soft real-time database systems  a database system contains base data items which record and model a physical, real world environment. for better decision support, base data items are summarized and correlated to derive views. these base data and views are accessed by application transactions to generate the ultimate actions taken by the system. as the environment changes, updates are applied to the base data, which subsequently trigger view recomputations. there are thus three types of activities: base data update, view recomputation, and transaction execution. in a real-time system, two timing constrains need to be enforced. we require transactions meet their deadlines (transaction timeliness) and read fresh data (data timeliness). in this paper we define the concept of absolute and relative temporal consistency from the perspective of transactions. we address the important issue of transaction scheduling among the three types of activities such that the two timing requirements can be met. we also discuss how a real-time database system should be designed to enforce different levels of temporal consistency.  ben kao k. y. lam brad adelberg reynold cheng tony lee
identity and versions for complex objects  identity is that property of an object that distinguishes each object from all others. identity has been investigated almost independently in general-purpose programming languages and database languages. its importance is growing as these two environments evolve and merge.  historical versions of persistent data is a natural and useful feature for a large number of applications. identity is even more important when retrievals may span multiple versions of a single object, since a mechanism is needed to preserve the fact that the various versions are of the same object.  there are at least two dimensions involved in the support of identity, the representation dimension and the temporal dimension. the representation dimension distinguishes languages based on whether they represent the identity of an object by its value (e.g., identifying employees by social security number), by a user- defined name (e.g., variable names, user defined file names, etc.), or built into the language (e.g., smalltalk-80). a language providing a stronger notion of identity in this dimension must maintain its representation of identity during updates, use identity in the semantics of its operators, and provide operators to manipulate identity. the temporal dimension distinguishes languages based on whether they preserve their representation of identity within a single program or transaction, between transactions, or between structural reorganizations. an example of structural reorganization is schema reorganization in databases. a language providing stronger identity in the temporal dimension must employ more robust implementation techniques to preserve its representation of identity.  the thesis of this abstract is that database conceptual languages should support the built in notion of identity and provide for the possibility of structural reorganizations. there are very few conceptual database models (in fact one we know of) that support this very strong notion of identity. most real-world organizations deal with histories of objects, but they have little support from existing systems to help them in modeling and retrieving historical data. strong support of identity in the temporal dimension is even more important for temporal data models, because a single retrieval may involve multiple historical versions of a single object. such support requires the database system to provide a continuous and consistent notion of identity throughout the life of each object, independently of any descriptive data or structure which is user modifiable. this identity is the common thread that ties together these historical versions of an object.  most of the current techniques for implementing object identity (such as as physical addresses, or identifier keys (i.e. groups of attributes which constitute the primary key) etc.) lack either location independence or data (i.e. object content) independence. the strong notion of identity is most easily supported using surrogates, which are system-generated, globally unique identifiers, completely independent of any physical location.  george p. copeland setrag n. khoshafian
choosing a medium for your message: what determines the choice of delivery media for technical documentation?  the current variety of media available to developers of technical documentation makes possible a richness of expression that goes beyond traditional conceptions. rich and effective documentation can result from a judicious combination of media. the introduction of new media techniques to the traditions of technical documentation creates not only new opportunities, but new problems as well.  this paper presents a case study of an ongoing project at apple computer that encountered numerous such opportunities and problems. we show what gave rise to them, how we dealt with them, and finally present some guidelines for documentation teams contemplating going "beyond the book."  harry j. saddler lori e. kaplan
applying the golden rule of sampling for query estimation  query size estimation is crucial for many database system components. in particular, query optimizers need efficient and accurate query size estimation when deciding among alternative query plans. in this paper we propose a novel sampling technique based on the golden rule of sampling, introduced by von neumann in 1947, for estimating range queries. the proposed technique randomly samples the frequency domain using the cumulative frequency distribution and yields good estimates without any a priori knowledge of the actual underlying distribution of spatial objects. we show experimentally that the proposed sampling technique gives smaller approximation error than the min-skew histogram based and wavelet based approaches for both synthetic and real datasets. moreover, the proposed technique can be easily extended for higher dimensional datasets.  yi-leh wu divyakant agrawal amr el abbadi
influence sets based on reverse nearest neighbor queries  inherent in the operation of many decision support and continuous referral systems is the notion of the "influence" of a data point on the database. this notion arises in examples such as finding the set of customers affected by the opening of a new store outlet location, notifying the subset of subscribers to a digital library who will find a newly added document most relevant, _etc._ standard approaches to determining the influence set of a data point involve range searching and nearest neighbor queries.  in this paper, we formalize a novel notion of influence based on reverse neighbor queries and its variants. since the nearest neighbor relation is not symmetric, the set of points that are closest to a query point (_i.e._, the nearest neighbors) differs from the set of points that have the query point as their nearest neighbor (called the reverse nearest neighbors). influence sets based on reverse nearest neighbor (rnn) queries seem to capture the intuitive notion of influence from our motivating examples.  we present a general approach for solving rnn queries and an efficient r-tree based method for large data sets, based on this approach. although the rnn query appears to be natural, it has not been studied previously. rnn queries are of independent interest, and as such should be part of the suite of available queries for processing spatial and multimedia data. in our experiments with real geographical data, the proposed method appears to scale logarithmically, whereas straightforward sequential scan scales linearly. our experimental study also shows that approaches based on range searching or nearest neighbors are ineffective at finding influence sets of our interest.  flip korn s. muthukrishnan
segmentation-based modeling for advanced targeted marketing fingerhut business intelligence (bi) has a long and successful history of building statistical models to predict consumer behavior. the models constructed are typically segmentation-based models in which the target audience is split into subpopulations (i.e., customer segments) and individually tailored statistical models are then developed for each segment. such models are commonly employed in the direct-mail industry; however, segmentation is often performed on an ad-hoc basis without directly considering how segmentation affects the accuracy of the resulting segment models. fingerhut bi approached ibm research with the problem of how to build segmentation-based models more effectively so as to maximize predictive accuracy. the ibm advanced targeted marketing-single eventstm (ibm atm-setm) solution is the result of ibm research and fingerhut bi directing their efforts jointly towards solving this problem. this paper presents an evaluation of atm-se's modeling capabilities using data from fingerhut's catalog mailings. c. apte e. bibelnieks r. natarajan e. pednault f. tipu d. campbell b. nelson