waashk/acm huggingface dataset:
flowback: providing backward recovery for workflow management systems  the distributed systems technology centre (dstc) framework for workflow specification, verification and management captures workflows transaction-like behavior for long lasting processes. flowback is an advanced prototype functionally enhancing an existing workflow management system by providing process backward recovery. it is based on extensive theoretical research ([3],[4],[5],[6],[8],[9]), and its architecture and construction assumptions are product independent. flowback clearly demonstrates the extent to which generic backward recovery can be automated and system supported. the provision of a solution for handling exceptional business process behavior requiring backward recovery makes workflow solutions more suitable for a large class of applications, therefore opening up new dimensions within the market. for the demonstration purpose, flowback operates with ibm flowmark, one of the leading workflow products.  bartek kiepuszewski ralf muhlberger maria e. orlowska
maintaining views incrementally  we present incremental evaluation algorithms to compute changes to materialized views in relational and deductive database systems, in response to changes (insertions, deletions, and updates) to the relations. the view definitions can be in sql or datalog, and may use union, negation, aggregation (e.g. sum, min), linear recursion, and general recursion.  we first present a counting algorithm that tracks the number of alternative derivations (counts) for each derived tuple in a view. the algorithm works with both set and duplicate semantics. we present the algorithm for nonrecursive views (with negation and aggregation), and show that the count for a tuple can be computed at little or no cost above the cost of deriving the tuple. the algorithm is optimal in that it computes exactly those view tuples that are inserted or deleted. note that we store only the number of derivations, not the derivations themselves.  we then present the delete and rederive algorithm, dred, for incremental maintenance of recursive views (negation and aggregation are permitted). the algorithm works by first deleting a superset of the tuples that need to be deleted, and then rederiving some of them. the algorithm can also be used when the view definition is itself altered.  ashish gupta inderpal singh mumick v. s. subrahmanian
viewing morphology as an inference process  morphology is the area of linguistics concerned with the internal structure of words. information retrieval has generally not paid much attention to word structure, other than to account for some of the variability in word forms via the use of stemmers. this paper will describe our experiments to determine the importance of morphology, and the effect that it has on performance. we will also describe the role of morphological analysis in word sense disambiguation, and in identifying lexical semantic relationships in a machine-readable dictionary. we will first provide a brief overview of morphological phenomena, and then describe the experiments themselves.  robert krovetz
state of the art issues in distributed databases (panel session): site autonomy issues in the r@@@@ distributed database system  it is desirable to have a distributed database management system (ddbms) whose behavior and control is as identical as possible to that used in single site database management systems. we call this notion site autonomy. preserving the autonomy of sites which join a ddbms network is essential to the peace of mind of its managers and users, and more technically, is essential in an environment where sites and communication lines fail. to achieve resilience to failures of sites and communication lines (these are indistinguishable from one site's viewpoint), there can be no reliance on centralized functions or services. this means no global dictionary, no global information collector for deadlock detection, and no broadcast of local events such as file creation or addition of a new site. aside from these prohibitions, this goal of site autonomy also implies that sites should perform their own compilation, their own binding of print names to internal names, their own decomposition of compound objects (such as relational views), and their own authorization checking. this talk discusses the concept of site autonomy in further detail and discusses several specific issues on which the site autonomy philosophy has an impact.  p. selinger
teaching experienced developers to design graphical user interfaces  five groups of developers with experience in the design of character- based user interfaces were taught graphical user interface design through a short workshop with a focus on practical design exercises using low-tech tools derived from the pictive method. several usability problems were found in the designs by applying the heuristic evaluation method, and feedback on these problems constituted a way to make the otherwise abstract usability principles concrete for the designers at the workshop. based on these usability problems and on observations of the design process, we conclude that object-oriented interactions are especially hard to design and that the developers were influenced by the graphical interfaces of personal computers with which they had interacted as regular users.  jakob nielsen rita m. bush tom dayton nancy e. mond michael j. muller robert w. root
security of random data perturbation methods  statistical databases often use random data perturbation (rdp) methods to protect against disclosure of confidential numerical attributes. one of the key requirements of rdp methods is that they provide the appropriate level of security against snoopers who attempt to obtain information on confidential attributes through statistical inference. in this study, we evaluate the security provided by three methods of perturbation. the results of this study allow the database administrator to select the most effective rdp method that assures adequate protection against disclosure of confidential information.  krishnamurty muralidhar rathindra sarathy
explaining ambiguity in a formal query language  the problem of generating reasonable natural language-like responses to queries formulated in nonnavigational query languages with logical data independence is addressed. an extended er model, the entity-relationship- involvement model, is defined which assists in providing a greater degree of logical data independence and the generation of natural language explanations of a query processor's interpretation of a query. these are accomplished with the addition of the concept of an involvement to the model. based on involvement definitions in a formally defined data definition language, ddl, an innovative strategy for generating explanations is outlined and exemplified. in the conclusion, possible extensions to the approach are given.  joseph a. wald paul g. sorenson
a formal approach to the assessment and improvement of terminological models used in information systems engineering in the design and implementation of any information system identifiers are used to designate concepts. typical examples are names of classes, variables, modules, database fields, etc. a terminological model is a set of identifiers together with a set of abstractions and a set of links between identifiers and abstractions. naturally, terminological models embody important knowledge of a system, and therefore they play an important role during the development of information systems. in this paper we propose a metamodel for terminological models that is based on category theory as conceptual and notational framework. peter wendorff
towards self-tuning data placement in parallel database systems  parallel database systems are increasingly being deployed to support the performance demands of end-users. while declustering data across multiple nodes facilitates parallelism, initial data placement may not be optimal due to skewed workloads and changing access patterns. to prevent performance degradation, the placement of data must be reorganized, and this must be done on-line to minimize disruption to the system.  in this paper, we consider a dynamic self-tuning approach to reorganization in a shared nothing system. we introduce a new index-based method that faciliates fast and efficient migration of data. our solution incorporates a globally height- balanced structure and load tracking at different levels of granularity. we conducted an extensive performance study, and implemented the methods on the fujitsu ap3000 machine. both the simulation and empirical results demonstratic that our proposed method is indeed scalable and effective in correcting any deterioration in system throughput.  mong li lee masaru kitsuregawa beng chin ooi kian-lee tan anirban mondal
a comparison of rule-based and positionally constant arrangements of computer menu items  an experiment was conducted to evaluate user performance under four different menu item arrangements: alphabetic, probability of selection (most popular choices are positioned near the beginning of the list), random, and positionally constant (consistent assignment of individual items to screen positions). during the initial stages of practice, the rule- based approaches produced faster mean search times, but after moderate amounts of practice, the positionally constant arrangement appeared to be most efficient. people seem to remember quite easily the location of items on a display, indicating that positional constancy can be an important factor in increasing the efficiency of the search of computer menus and other displays.  benjamin l. somberg
computational aspects of resilient data extraction from semistructured sources (extended abstract)  automatic data extraction from semistructured sources such as html pages is rapidly growing into a problem of significant importance, spurred by the growing popularity of the so called "shopbots" that enable end users to compare prices of goods and other services at various web sites without having to manually browse and fill out forms at each one of these sites.  the main problem one has to contend with when designing data extraction techniques is that the contents of a web page changes frequently, either because its data is generated dynamically, in response to filling out a form, or because of changes to its presentation format. this makes the problem of data extraction particularly challenging, since a desirable requirement of any data extraction technique is that it be "resilient", i.e., using it we should always be able to locate the object of interest in a page (such as a form or an element in a table generated by a form fill-out) in spite of changes to the page's ntent and layout.  in this paper we propose a formal computation model for developing resilient data extraction techniques from semistructured sources. specifically we formalize the problem of data extraction as one of generating unambiguous extraction expressions, which are regular expressions with some additional structure. the problem of resilience is then formalized as one of generating a maximal extraction expression of this kind. we present characterization theorems for maximal extraction expressions, complexity results for testing them, and algorithms for synthesizing them.  hasan davulcu guizhen yang michael kifer i. v. ramakrishnan
enhanced nearest neighbour search on the r-tree  multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that efficient retrieval of data can be provided. r-tree with its variations, is a commonly cited indexing method. in this paper we propose an improved nearest neighbor search algorithm on the r-tree and its variants. the improvement lies in the removal of two hueristics that have been used in previous r*-tree work, which we prove cannot improve on the pruning power during a search.  king lum cheung ada wai-chee fu
user effort in query construction and interface selection  this study was designed to examine user beliefs and behavior on the selection and use of search features and search interfaces. five weeks of user logs were taken from a user-targeted collection and surveys were administered immediately before and after this time period. survey results indicate a significant correlation between a user's level of effort and their perceived benefit from that effort.reported search feature use increased by more than 35\% over the fiveweeks. this raises the question of how the behavior of an internet user changes over time. results from the log files were inconclusive but suggest a reluctance to use the advanced search interface.  paul gerwe charles l. viles
rough sets and information retrieval  the theory of rough sets was introduced [pawlak82]. it allows us to classify objects into sets of equivalent members based on their attributes. we may then examine any combination of the same objects (or even their attributes) using the resultant classification. the theory has direct applications in the design and evaluation of classification schemes and the selection of discriminating attributes. pawlak's papers discuss its application in the domain of medical diagnostic systems. here we apply it to the design of information retrieval systems accessing collections of documents. advantages offered by the theory are: the implicit inclusion of boolean logic; term weighting; and the ability to rank retrieved documents. in the first section we describe the theory. this is derived from the work by [pawlak84, pawlak82] and includes only the most relevant aspects of the theory. in the second we apply it to information retrieval. specifically, we design the approximation space, search strategies as well as illustrate the application of relevance feedback to improve document indexing. following this in section three we compare the rough set formalism to the boolean, vector and fuzzy models of information retrieval. finally we present a small scale evaluation of rough sets which indicates its potential in information retrieval.  p. das-gupta
object-focused interaction in collaborative virtual environments  this paper explores and evaluates the support for object-focused interaction provided by a desktop collaborative virtual environment. an experimental "design" task was conducted, and video recordings of the participants' activities facilitated an observational analysis of interaction in, and through, the virtual world. observations include: problems due to "fragmented" views of embodiments in relation to shared objects; participants compensating with spoken accounts of their actions; and difficulties in understanding others' perspectives. implications and proposals for the design of cves drawn from these observations are: the use of semidistorted views to support peripheral awareness; more explicit or exaggerated representations of actions than are provided by pseudohumanoid avatars; and navigation techniques that are sensitive to the actions of others. the paper also presents some examples of the ways in which these proposals might be realized.  jon hindmarsh mike fraser christian heath steve benford chris greenhalgh
documentation writers as screen designers for interactive computer systems  for interactive computer systems, most of the communication between users and the computer occurs via the written and graphic information shown on the video display terminal. let's call that information "the screen," whether it shows text or graphics. effective communication between the user and the system depends on how well the screen has been designed. one aspect of that design is how the screens, individually and as a whole, have been worded and organized for overall readability.  karen van dusen nichole j. vick
participatory design of a portable torque-feedback device  customer- driven design processes such as participatory design can be used to develop new presence, or virtual reality, technology. chemists worked together with computer company engineers to develop scenarios for how present technology could be used to support future molecular modeling work in drug design. these scenarios led to the development of a portable torque-feedback device which can be used with either workstation or virtual reality technology. this paper discusses both the experience with the participatory design process and the novel features of the portable torque-feedback device.  michael good
experiments on incorporating syntactic processing of user queries into a document retrieval strategy  traditional information has relied on the extensive use of statistical parameters in the implementation of retrieval strategies. this paper sets out to investigate whether linguistic processes can be used as part of a document retrieval strategy. this is done by predefining a level of syntactic analysis of user queries only, to be used as part of the retrieval process. a large series of experiments on an experimental test collection are reported which use a parser for noun phrases as part of the retrieval strategy. the results obtained from the experiments do yield improvements in the level of retrieval effectiveness and given the crude linguistic process used and the way it was used on queries and not on document texts, suggests that the approach of using linguistic processing in retrieval, is valid.  a. f. smeaton c. j. van rijsbergen
on the development of user interface systems for object-oriented database  in this paper we present a user interface system which provides a complete environment for improved browsing in object-oriented database management systems (oodbmss). the system uses only the basic features of the object- oriented data model, so it can be associated to different oodbmss. the design of our system is based on features that, in our opinion, should be present in any database user interface system. we present and discuss such features.  j. lopes de oliveira
aries/im: an efficient and high concurrency index management method using write-ahead logging  this paper provides a comprehensive treatment of index management in transaction systems. we present a method, called ariesiim (algorithm for recovery and isolation exploiting semantics for index management), for concurrency control and recovery of b+-trees. aries/im guarantees serializability and uses write-ahead logging for recovery. it supports very high concurrency and good performance by (1) treating as the lock of a key the same lock as the one on the corresponding record data in a data page (e.g., at the record level), (2) not acquiring, in the interest of permitting very high concurrency, commit duration locks on index pages even during index structure modification operations (smos) like page splits and page deletions, and (3) allowing retrievals, inserts, and deletes to go on concurrently with smos. during restart recovery, any necessary redos of index changes are always performed in a page-oriented fashion (i.e., without traversing the index tree) and, during normal processing and restart recovery, whenever possible undos are performed in a page- oriented fashion. aries/im permits different granularities of locking to be supported in a flexible manner. a subset of aries/im has been implemented in the os/2 extended edition database manager. since the locking ideas of aries/im have general applicability, some of them have also been implemented in sql/ds and the vm shared file system, even though those systems use the shadow-page technique for recovery.  c. mohan frank levine
the effects of bargaining orientation and communication medium on negotiations in the bilateral monopoly task: a comparison of decision room and computer conferencing communication media  pairs of subjects with either a competitive or an integrative bargaining orientation completed the bilateral monopoly task in one of four communication media (text- only, text-plus- visual-access, audio-only, and audio-plus- visual-access). as hypothesized, an integrative bargaining orientation and/or an audio mode of communication led to a higher joint outcome. in addition, visual access resulted in higher joint outcomes for subjects with integrative bargaining orientations, but lower joint outcomes for those with competitive orientations. the support for negotiation offered by decision room and computer conferencing technologies is compared based on the efficiency and richness of the communication media available in each.  j. sheffield
a framework for effective retrieval  the aim of an effective retrieval system is to yield high recall and precision (retrieval effectiveness). the nonbinary independence model, which takes into consideration the number of occurrences of terms in documents, is introduced. it is shown to be optimal under the assumption that terms are independent. it is verified by experiments to yield significant improvement over the binary independence model. the nonbinary model is extended to normalized vectors and is applicable to more general queries.  various ways to alleviate the consequences of the term independence assumption are discussed. estimation of parameters required for the nonbinary independence model is provided, taking into consideration that a term may have different meanings.  c. t. yu w. meng s. park
pipelining in multi-query optimization  database systems frequently have to execute a set of related queries, which share several common subexpressions. multi-query optimization exploits this, by finding evaluation plans that share common results. current approaches to multi-query optimization assume that common subexpressions are materialized. significant performance benefits can be had if common subexpressions are pipelined to their uses, without being materialized. however, plans with pipelining may not always be realizable with limited buffer space, as we show. we present a general model for schedules with pipelining, and present a necessary and sufficient condition for determining validity of a schedule under our model. we show that finding a valid schedule with minimum cost is _np_-hard. we present a greedy heuristic for finding good schedules. finally, we present a performance study that shows the benefit of our algorithms on batches of queries from the tpcd benchmark.  nilesh n. dalvi sumit k. sanghai prasan roy s. sudarshan
a theory of intersection anomalies in relational database schemes  the desirability of acyclic database schemes is well argued in [8] and [13]. for schemas described by multivalued dependencies, acyclicity means that the dependencies do not split each other's left-hand sides and do not form intersection anomalies. in a recent work [4] it is argued that real-world database schemes always meet the former requirement, and in [5] it is shown that any given real-world scheme can be made to satisfy also the latter requirement, after being properly extended. however, the method of elimination of intersection anomalies proposed in [5] is intrinsically nondeterministic--- an undesirable property for a design tool. in the present work it is shown that this nondeterminism does not, however, affect the final result of the design process. in addition, we present an efficient deterministic algorithm, which is equivalent to the nondeterministic process of [5]. along the way a study of intersection anomalies, which is interesting in its own right, is performed.  catriel beeri michael kifer