waashk/acm huggingface dataset:
constructing olap cubes based on queries an on-line analytical processing (olap) user often follows a train of thought, posing a sequence of related queries against the data warehouse. although their details are not known in advance, the general form of those queries is apparent beforehand. thus, the user can outline the relevant portion of the data posing generalised queries against a cube representing the data warehouse.since existing olap design methods are not suitable for non-professionals, we present a technique that automates cube design given the data warehouse, functional dependency information, and sample olap queries expressed in the general form. the method constructs complete but minimal cubes with low risks related to sparsity and incorrect aggregations. after the user has given queries, the system will suggest a cube design. the user can accept it or improve it by giving more queries. the method is also suitable for improving existing cubes using respective real mdx queries. tapio niemi jyrki nummenmaa peter thanisch
decision-supportive modeling techniques for production planning (abstract only)  proper analysis of production systems becomes quite complex when considering large, multiple-product systems. production becomes limited when products compete for resources that are shared among products and production lines. these limitations can cause collisions, backlogging, and underutilization of these resources. within the scope of industrial planning, several goals should be met as a result of the application of production analysis techniques. these include the determination of: production levels for each product, utilization of production resources, and costs of production. discussion will be directed towards the problem situation, the problem needs, and applicable solution approaches.  corey d. schou
expressive power and data complexity of nonrecursive query languages for lists and trees (extended abstract)  we extend the traditional query languages by primitives for handling lists and trees. our main results characterize the expressive power and data complexity of the following extended languages: (1) relational algebra with lists and trees, (2) nonrecursive datalog@@@@ with lists and trees, (3) nonrecursive prolog with lists and trees, (4) first-order logic over lists and trees.  languages (2)-(4) turn out to have the same expressive power; their range- restricted fragments have the same expressive power as (1). every query in these languages is a boolean combination of range-restricted queries.  we also prove that these query languages have polynomial data complexity under any "reasonable" encoding of inputs. furthermore, under a natural encoding of inputs, languages (2)-(4) have the same expressive power as first-order logic over finite structures, therefore their data complexity is in a co. thus, the use of lists and trees in nonrecursive query languages gives no gain in the expressiveness. this contrasts with a huge difference between the nonelementary program complexity of extended languages (2)-(4) and the pspa ce program complexity of their relational counterparts.  our results partly explain why lists and trees are not so widely used in nonrecursive query languages as other collection types.  evgeny dantsin andrei voronkov
fixed-point query languages for linear constraint databases  we introduce a family of query languages for linear constraint databases over the reals. the languages are defined over two-sorted structures, the first sort being the real numbers and the second sort consisting of a decomposition of the input relation into regions. the languages are defined as extensions of first-order logic by transitive closure or fixed-point operators, where the fixed-point operators are defined over the set of regions only. it is shown that the query languages capture precisely the queries definable in various standard complexity classes including ptime.  stephan kreutzer
complete logical routings in computer mail systems  the logical routing of a message in a computer mail system involves the identification and location of the set of intended recipients for that message. this function is carried out by the naming and addressing mechanism of the mail system. an important property of that mechanism is that it should be able to identify and locate all the intended recipients of a message, so that, once submitted, a message will not become lost or stuck in the system. we first discuss message addressing schemes, which are a framework for dealing with the naming and addressing problem. message addressing schemes can also serve as a basis for the analysis of some of the properties of logical message routing within a system. we examine the conditions necessary for a complete message addressing scheme, that is, one that guarantees to deliver all possible messages.  p. martin d. tsichritzis
specification and implementation of exceptions in workflow management systems  although workflow management systems are most applicable when an organization follows standard business processes and routines, any of these processes faces the need for handling exceptions, i.e., asynchronous and anomalous situations that fall outside the normal control flow.  in this paper we concentrate upon anomalous situtations that, although unusual, are part of the semantics of workflow applications, and should be specified and monitored coherently; in most real- life applications, such exceptions affect a significant fraction of workflow cases. however, very few workflow management systems are integrated with a highly expressive language for specifying this kind of exception and with a system component capable of handling it.  we present chimera-exc, a language for the specification of exceptions for workflows based on detached active rules, and then describe the architecture of a system, called far, that implements chimera-exc and integrates it with a commercial workflow management system and database server. we discuss the main issues that were solved by our implementation, and report on the performance of far. we also discuss design criteria for exceptions in light of the formal properties of their execution. finally, we focus on the portability of far on its unbundling to a generic architecture with detached active rules.  fabio casati stefano ceri stefano paraboschi guiseppe pozzi
towards an interaction level for object-oriented geographic database systems  geographic database systems are large and complex systems characterized by a high degree of interactivity. though the object-oriented approach is powerful enough for the representation of geographic information, the availability of a flexible and easy-to-use interaction level is essential for most users. in this paper, we focus on three major issues concerning any interaction level to be built on top of an object-oriented geographic database system, namely: spatial data modeling, user views, and browsing through spatial information  .  despite what really is represented at the logical level, the spatial data model we refer to in this paper explicitly represents all kinds of spatial and non-spatial relationships of interest in the geographic context. this results in an effective conceptual tool for the definition of two different categories of views (namely, frame-based and map-based views). both categories of views feature a high degree of flexibility; in fact, users are allowed to specialize the contents of a view according to their specific needs. a way of combining browsing and querying during the activity of exploring large spatial geographic databases through views is finally sketched in the paper.  eliseo clementini paolino di felice
implementing smart for minicomputers via relational processing with abstract data types  designed during the 1960's as a research tool for the field of information retrieval, the smart system has been operating on an ibm 370 since 1974. smart is now being enhanced, redesigned, and programmed under the unix operating system [28] on a dec vax 11/780. the techniques used should allow real-time operation on smaller minicomputers in the pdp 11 family. the implementation provides for a combination of database and information retrieval operations which make it applicable to office automation, personal information system management, and research studies.  the smart vector space model, which treats information requests and stored information records as vectors in an n-space (of terms), is integrated into the relational database model using the concepts of abstract data types (adts). domains of relations are allowed to be any adt; an extended relational algebra is described with operators that manipulate many complex data structures. after illustrating the application of these concepts to typical smart tasks, a prototype implementation is outlined. also included is a discussion of techniques to be employed in a more efficient version.  edward a. fox
querying websites using compact skeletons  several commercial applications, such as online comparison shopping and process automation, require integrating information that is scattered across multiple websites or xml documents. much research has been devoted to this problem, resulting in several research prototypes and commercial implementations. such systems rely on wrappers that provide relational or other structured interfaces to websites. traditionally, wrappers have been constructed by hand on a per- website basis, constraining the scalability of the system.  we introduce a website structure inference mechanism called _compact skeletons_ that is a step in the direction of automated wrapper generation. compact skeletons provide a transformation from websites or other hierarchical data, such as xml documents, to relational tables. we study several classes of compact skeletons and provide polynomial- time algorithms and heuristics for automated construction of compact skeletons from websites. experimental results show that our heuristics work well in practice. we also argue that compact skeletons are a natural extension of commercially deployed techniques for wrapper construction.  anand rajaraman jeffrey d. ullmann
(almost) optimal parallel block access to range queries  this guarantee is true for any number of dimensions. subsequent to this work, bhatia et al. [4] have proved that such a performance bound is essentially optimal for this kind of scheme, and have also extended our results to the case where the number of disks is a product of the form  1 * 2 * … * t where the  ts need not all be 2.  mikhail j. atallah sunil prabhakar
gloss: text-source discovery over the internet  the dramatic growth of the internet has created a new problem for users: location of the relevant sources of documents. this article presents a framework for (and experimentally analyzes a solution to) this problem, which we call the text-source discovery problem. our approach consists of two phases. first, each text source exports its contents to a centralized service. second, users present queries to the service, which returns an ordered list of promising text sources. this article describes gloss, glossary of servers server, with two versions: bgloss, which provides a boolean query retrieval model, and vgloss, which provides a vector-space retrieval model. we also present hgloss, which provides a decentralized version of the system. we extensively describe the methodology for measuring the retrieval effectiveness of these systems and provide experimental evidence, based on actual data, that all three systems are highly effective in determining promising text sources for a given query.  luis gravano hector garcia-molina anthony tomasic
exploring the boundaries of successful gss application: supporting inter- organizational policy networks technologies used to support group work are based on, and contain underlying assumptions regarding, how people work together. the appropriateness of such assumptions is an important factor in determining the successful employment of the technology. this paper uses an action research approach to explore the boundaries of effective gss application by challenging the basic assumptions built into gss. this exploration is carried out in the context of a particular arena in which groups have to interact to reach a certain goal: inter-organizational policy networks. from nine cases it appears that gss are most effective in the orientation phase of inter-organizational policy making, while gss should be avoided during the separation phase where winners and losers can be identified. during the package deal phase of an inter-organizational policy making process, gss may have added value to offer, but the technology should be employed with caution. these findings are consistent with various experimental studies that found that gss application is more successful for creativity tasks than for preference tasks and mixed motive tasks. gert-jan de vreede hans de bruijn
semantics of query languages for network databases  semantics determines the meaning of language constructs; hence it says much more than syntax does about implementing the language. the main purpose of this paper is a formal presentation of the meaning of basic language constructs employed in many database languages (sublanguages). therefore, stylized query languages ssl (sample selection language) and j (joins) are introduced, wherein most of the typical entries present in other query languages are collected. the semantics of ssl and j are defined by means of the denotational method and explained informally. in ssl and j, four types of expressions are introduced: a selector (denotes a set of addresses), a term (denotes a set of values), a formula (denotes a truth value), and a join (denotes a set of n-tuples of addresses or values). in many cases alternative semantics are given and discussed. in order to obtain more general properties of the proposed languages, a new database access model is introduced, intended to be a tool for the description of the logical access paths to data. in particular, the access paths of the network and relational models can be described. ssl and j expressions may be addressed to both data structures. in the case of the relational model, expressions of j are similar to sql or quel statements. thus j may be considered a generalization of relational query languages for the network model. finally, a programming language, based on ssl and j, is outlined, and the issues of ssl and j implementation are considered.  kazimierz subieta
approximating multi-dimensional aggregate range queries over real attributes  finding approximate answers to multi-dimensional range queries over real valued attributes has significant applications in data exploration and database query optimization. in this paper we consider the following problem: given a table of _d_ attributes whose domain is the real numbers, and a query that specifies a range in each dimension, find a good approximation of the number of records in the table that satisfy the query.  we present a new histogram technique that is designed to approximate the density of multi-dimensional datasets with real attributes. our technique finds buckets of variable size, and allows the buckets to overlap. overlapping buckets allow more efficient approximation of the density. the size of the cells is based on the local density of the data. this technique leads to a faster and more compact approximation of the data distribution. we also show how to generalize kernel density estimators, and how to apply them on the multi-dimensional query approximation problem.  finally, we compare the accuracy of the proposed techniques with existing techniques using real and synthetic datasets.  dimitrios gunopulos george kollios vassilis j. tsotras carlotta domeniconi
efficiently supporting procedures in relational database systems  we examine an extended relational database system which supports database procedures as full fledged objects. in particular, we focus on the problems of query processing and efficient support for database procedures. first, a variation to the original ingres decomposition algorithm is presented. then, we examine the idea of storing results of previously processed procedures in secondary storage (caching). using a cache, the cost of processing a query can be reduced by preventing multiple evaluations of the same procedure. problems associated with cache organizations, such as replacement policies and validation schemes are examined. another means for reducing the execution cost of queries is indexing. a new indexing scheme for cached results, partial indexing, is proposed and analyzed.  timos k. sellis
augmenting the organizational memory: a field study of answer garden  a growing concern for organizations and groups has been to augment their knowledge and expertise. one such augmentation is to provide an organizational memory, some record of the organization's knowledge. however, relatively little is known about how computer systems might enhance organizational, group, or community memory.  this paper presents findings from a field study of one such organizational memory system, the answer garden. the paper discusses the usage data and qualitative evaluations from the field study, and then draws a set of lessons for next- generation organizational memory systems.  mark s. ackerman
a multimodal framework for music inputs (poster session)  the growth of digital music databases imposes new content-based methods of interfacing with stored data; although indexing and retrieval techniques are deeply investigated, an integrated view of querying mechanism has never been established before. moreover, the multimodal nature of music should be exploited to match the users' expectations as well as their skills. in this paper, we propose a hierarchy of music-interfaces that is suitable for existent prototypes of music information retrieval systems; according to this framework, human/computer interaction should be improved by singing, playing or notating music. dealing with multiple inputs poses many challenging problems for both their combination and the low-level translation needed to transform an acoustic signal into a symbolic representation. this paper addresses the latter problem in some details, aiming to develop music- interfaces available not only to trained-musician.  goffredo haus emanuele pollastri
the dataindex: a structure for smaller, faster data warehouses in this paper we present dataindexes, a family of design strategies for data warehouses to support online analytical processing (olap). as the name implies, dataindexes are both a storage structure for the warehoused relational data and an indexing scheme to provide fast access to that data. we present two simple dataindexes: the basic dataindex (bdi), which can be used for any attribute and the join dataindex (jdi), which is used for foreign-key attributes. either structure can be shown to significantly improve query response times in most cases. and, since they serve as indexes as well as the store of base data, dataindexes actually define a physical design strategy for a data warehouse where the indexing, for all intents and purposes, comes for "free." anindya datta igor viguier
automatic impact sound generation for using in nonvisual interfaces  this paper describes work in progress on automatic generation of "impact sounds" based on purely physical modelling. these sounds can be used as non- speech audio presentation of objects and as interaction mechanisms to non visual interfaces. different approaches for synthesizing impact sounds, the process of recording impact sounds and the analysis of impact sounds are introduced. a physical model for describing impact sounds "spherical objects hitting flat plates or beams" is presented. some examples of impact sounds generated by mentioned physical model and comparison of spectra of real recorded sounds and model generated impact sounds (generated via physical modelling) are discussed. the objective of this research project (joint project university of zurich and swiss federal institute of technology) is to develop a concept, methods and a prototype for an audio framework. this audio framework shall describe sounds on a highly abstract semantic level. every sound is to be described as the result of one or several interactions between one or several objects at a certain place and in a certain environment.  a. darvishi e. munteanu v. guggiana h. schauer m. motavalli m. rauterberg
an execution model for limited ambiguity rules and its application to derived data update  a novel execution model for rule application in active databases is developed and applied to the problem of updating derived data in a database represented using a semantic, object-based database model. the execution model is based on the use of "limited ambiguity rules" (lars), which permit disjunction in rule actions. the execution model essentially performs a breadth-first exploration of alternative extensions of a user-requested update. given an object-based database schema, both integrity constraints and specifications of derived classes and attributes are compiled into a family of limited ambiguity rules. a theoretical analysis shows that the approach is sound: the execution model returns all valid "completions" of a user-requested update, or terminates with an appropriate error notification. the complexity of the approach in connection with derived data update is considered.  i.-min a. chen richard hull dennis mcleod
integration of text retrieval technology into formatted (conventional) information systems conventional information systems are characterized by data management, which is formatted according to the characterization, prepared by a systems analyst, in conjunction with the user of the new system. the operating principles of these systems enable efficient data management and the resolution of a broad range of problems. at times, systems of this nature do not meet the complex needs of an organization, such as the management of data that is difficult to characterize precisely, or the management of occasional activities that do not justify a separate system, etc.text retrieval technology provides management of "open" data, as well as a wide range of other data management forms. this paper presents the advantages of integrating text retrieval technology into formatted information systems in order to solve the above problems. offer drori
extending fitts' law to two-dimensional tasks  fitts' law, a one- dimensional model of human movement, is commonly applied to two-dimensional target acquisition tasks on interactive computing systems. for rectangular targets, such as words, it is demonstrated that the model can break down and yield unrealistically low (even negative!) ratings for a task's index of difficulty (id). the shannon formulation is shown to partially correct this problem, since id is always ≥ 0 bits. as well, two alternative interpretations "target width" are introduced that accommodate the two- dimensional nature of tasks. results of an experiment are presented that show a significant improvement in the model's performance using the suggested changes.  i. scott mackenzie william buxton
on interpretations of relational languages and solutions to the implied constraint problem  the interconnection between conceptual and external levels of a relational database is made precise in terms of the notion of "interpretation" between first-order languages. this is then used to obtain a methodology for discovering constraints at the external level that are "implied" by constraints at the conceptual level and by conceptual-to-external mappings. it is also seen that these concepts are important in other database issues, namely, automatic program conversion, database design, and compile-time error checking of embedded database languages. although this the deals exclusively with the relational approach, it also discusses how these ideas can be extended to hierarchical and network databases.  barry e. jacobs anthony c. klug alan r. aronson