waashk/acm huggingface dataset:
melodic matching techniques for large music databases  with the growth in digital representations of music, and of music stored in these representations, it is increasingly attractive to search collections of music. one mode of search is by similarity, but, for music, similarity search presents several difficulties: in particular, for melodic query support, deciding what part of the music is likely to be perceived as the theme by a listener, and deciding whether two pieces of music with different sequences of notes represent the same theme. in this paper we propose a three-stage framework for matching pieces of music. we use the framework to compare a range of techniques for determining whether two pieces of music are similar, by experimentally testing their ability to retrieve different transcriptions of the same piece of music from a large collection of midi files. these experiments show that different comparison techniques differ widely in their effectiveness; and that, by instantiating the framework with appropriate music manipulation and comparison techniques, pieces of music that match a query can be identified in a large collection.  alexandra uitdenbgerd justin zobel
a critical investigation of recall and precision as measures of retrieval system performance  recall and precision are often used to evaluate the effectiveness of information retrieval systems. they are easy to define if there is a single query and if the retrieval result generated for the query is a linear ordering. however, when the retrieval results are weakly ordered, in the sense that several documents have an identical retrieval status value with respect to a query, some probabilistic notion of precision has to be introduced. relevance probability, expected precision, and so forth, are some alternatives mentioned in the literature for this purpose. furthermore, when many queries are to be evaluated and the retrieval results averaged over these queries, some method of interpolation of precision values at certain preselected recall levels is needed. the currently popular approaches for handling both a weak ordering and interpolation are found to be inconsistent, and the results obtained are not easy to interpret. moreover, in cases where some alternatives are available, no comparative analysis that would facilitate the selection of a particular strategy has been provided. in this paper, we systematically investigate the various problems and issues associated with the use of recall and precision as measures of retrieval system performance. our motivation is to provide a comparative analysis of methods available for defining precision in a probabilistic sense and to promote a better understanding of the various issues involved in retrieval performance evaluation.  vijay raghavan peter bollmann gwang s. jung
optimization techniques for queries with expensive methods  object- relational database management systems allow knowledgeable users to define new data types as well as new methods (operators) for the types. this flexibility produces an attendant complexity, which must be handled in new ways for an object-relational database management system to be efficient. in this article we study techniques for optimizing queries that contain time- consuming methods. the focus of traditional query optimizers has been on the choice of join methods and orders; selections have been handled by "pushdown" rules. these rules apply selections in an arbitrary order before as many joins as possible, using th e assumption that selection takes no time. however, users of object-relational systems can embed complex methods in selections. thus selections may take significant amounts of time, and the query optimization model must be enhanced. in this article we carefully define a query cost framework that incorporates both selectivity and cost estimates for selections. we develop an algorithm called predicate migration, and prove that it produces optimal plans for queries with expensive methods. we then describe our implementation of predicate migration in the commercial object-relational database management system illustra, and discuss practical issues that affect our earlier assumptions. we compare predicate migration to a variety of simplier optimization techniques, and demonstrate that predicate migration is the best general solution to date. the alternative techniques we present may be useful for constrained workloads.  joseph m. hellerstein
a society model for office information systems  a society model, which characterizes the behavior and procedure of offices, is proposed. it is our belief that an office system capable of dealing with all real office problems only through the modeling of the internal behavior of an office can be developed. in this society model, office entities are viewed as agents. an agent is modeled as a microsociety of interacting knowledge sources. within the microsociety, there exists a microknowledge exchange system, which provides a set of microknowledge exchange protocols as a coordination system among those knowledge sources during their cooperative reasoning process. an office is then modeled as a society of various interacting agents using their knowledge to complete the office goals cooperatively. it is this unified view that allows offices to be modeled in a flexible and general way.  cheng- seen ho yang-chang hong te-son kuo
the decoupled simulation model for virtual reality systems  the virtual reality user interface style allows the user to manipulate virtual objects in a 3d environment using 3d input devices. this style is best suited to application areas where traditional two dimensional styles fall short, but the current programming effort required to produce a vr application is somewhat large. we have built a toolkit called mr, which facilitates the development of vr applications. the toolkit provides support for distributed computing, head-mounted displays, room geometry, performance monitoring, hand input devices, and sound feedback. in this paper, the architecture of the toolkit is outlined, the programmer's view is described, and two simple applications are described.  chris shaw jiandong liang mark green yunqi sun
towards robust features for classifying audio in the cuevideo system  the role of audio in the context of multimedia applications involving video is becoming increasingly important. many efforts in this area focus on audio data that contains some built-in semantic information structure such as in broadcast news, or focus on classification of audio that contains a single type of sound such as cleaar speech or clear music only. in the cuevideo system, we detect and classify audio that consists of mixed audio, i.e. combinations of speech and music together with other types of background sounds. segmentation of mixed audio has applications in detection of story boundaries in video, spoken document retrieval systems, audio retrieval systems etc. we modify and combine audio features known to be effective in distinguishing speech from music, and examine their behavior on mixed audio. our preliminary experimental results show that we can achieve a classification accuracy of over 80% for such mixed audio. our study also provides us with several helpful insights related to analyzing mixed audio in the context of real applications.  savitha srinivasan dragutin petkovic dulce ponceleon
clustering in object-oriented databases  object-oriented database management systems are still a relatively new area, with many unanswered questions as to their performance. objects can be clustered on disk (i.e., stored in contiguous storage areas) so that when accessing one object in a cluster, all of the objects in that cluster are brought into main memory. thus when accessing additional objects in the cluster, it is then a main memory operation rather than a disk operation.  unfortunately, determing which objects to cluster together is often left entirely up to the user, and an improper clustering scheme can severly degrade system performance. this paper presents a set of guidelines for developing a clustering scheme, using an actual application as an example.  everton g. de paula michael l. nelson
query driven knowledge discovery in multidimensional data  we study kdd (knowledge discovery in databases) processes on multidimensional data from a query point of view. focusing on association rule mining, we consider typical queries to cope with the pre-processing of multidimensional data and the post-processing of the discovered patterns as well. we use a model and a rule-based language stemming from the olap multidimensional representation, and demonstrate that such a language fits well for writing kdd queries on multidimensional data. using an homogeneous data model and our language for expressing queries at every phase of the process appears as a valuable step towards a better understanding of interactivity during the whole process.  jean-françois boulicaut patrick marcel christophe rigotti
autocompletion in full text transaction entry: a method for humanized input  a method for interactive validation of transaction data with autocompletion is introduced and analyzed in a library information system for periodical publications. the system makes it possible to identify the periodicals by using the full title thus making a separate coding phase unnecessary. only the characters that are needed to distinguish the title from other ones have to be typed. in our library this is in the average 4.3 characters. we have noticed that it is faster to use the auto-completion system compared with the use of short codes and a code catalogue. the auto- completion feature causes more errors at least for the novices because the work differs from normal typing. the errors are, however, very easy to correct with the assistance of the system.  m. jakobsson
spatial data traversal in road map databases: a graph indexing approach  spatial data are found in geographic information systems such as digital road map databases where city and road attributes are associated with nodes and links in a directed graph. queries on spatial data are expensive because of the recursive property of graph traversal. we propose a graph indexing technique to expedite spatial queries where the graph topology remains relatively stationary. using a probabilistic analysis, this paper shows that the graph indexing technique significantly improves the efficiency of constrained spatial queries.  j. leon zhao ahmed zaki
groupwork close up: a comparison of the group design process with and without a simple group editor  a simple collaborative tool, a shared text editor called shredit, changed the way groups of designers performed their work, and changed it for the better. first, the designs produced by the 19 groups of three designers were of higher quality than those of the 19 groups who worked with conventional whiteboard, paper and pencil. the groups with the new tool reported liking their work process a little less, probably because they had to adapt their work style to a new tool. we expected, from the brainstorming literature and recent work on group support systems, that the reason the designs were of better quality was that the supported groups generated more ideas. to our surprise, the groups working with shredit generated fewer design ideas, but apparently better ones. it appears that the tool helped the supported groups keep more focused on the core issued in the emerging design, to waste less time on less important topics, and to capture what was said as they went. this suggests that small workgroups can capitalize on the free access they have to a shared workspace, without requiring a facilitator or a work process embedded in the software.  judith s. olson gary m. olson marianne storrøsten mark carter
query processing and file management issues in partitioned databases (abstract)  this study reviews the database partitioning techniques and elaborates on features of storage organization from efficiency and query processing standpoints. methods for static files have excellent utilization records but require variable number of disk accesses, are prone to overflows, and may need re-organization when changes are made. dynamic file schemes with directories have good retrieval query performance but tend to achieve low storage utilization, suffer from growing directory, and may propagate the effects of an update to several regions and possibly all the way up to the highest level directory.  partitioning very large databases has become an intense research area over the last few years. the characteristics of partitioned file organizations have profound effects on the efficiency of query processing and database updates.  we have identified two main partitioning methodologies: static and dynamic files. while with static files we can achieve good utilization, they result in variable disk accesses per query and need frequent file reorganizations due to updates. as with the dynamic files we can achieve constant number of disk accesses for all queries at the expense of relatively low utilization (for uniform as well as non-uniform data distributions), directory sizes may grow fast, and handling of updates efficiently in extreme cases may be difficult.  to this date very few has been researched in the area of updates of partitioned file organizations. however, as can be seen in our discussions there are important problems awaiting to be tackled in this area especially with respect to directory structures.  esen ozkarahan h. cem bozsahin
audio-visual data mapping for gis-based data: an experimental evaluation  in this work, we present our experience of utilizing audio-visual data mappings for gis-based information visualization. the application we choose is a gis-based system for visualizing crime in a city. in this application, we enhance the pseudo-colored visual presentation of crime information by mapping data to several sound parameters --- volume, balance, bass and treble. our motivation for choosing sound in addition to vision is guided by our belief that data quantities mapped to various colors in a coloring scheme do not always clearly describe the information being presented for many different tasks that visualization is expected to support in many cases additional data characteristics can be conveyed to the user through sound to enhance the performance of the user on those tasks. we have conducted experiments with human users to compare the performance of users on visual data mapping alone vs. visual and sound data mappings together on several tasks including estimates of raw data values, local averaging, and global comparison. in most cases, we found that the use of bi-modal visual and sound data mappings together provided more accurate understanding of data displays  suresh k. lodha abigail j. joseph jose c. renteria
two-dimensional substring indexing  as databases have expanded in scope to storing string data (xml documents, product catalogs), it has become increasingly important to search databases based on matching substrings, often on multiple, correlated dimensions. while string b-trees are i/o optimal in one dimension, no index structure with non- trivial query bounds is known for two-dimensional substring indexing.  in this paper, we present a technique for two-dimensional substring indexing based on a reduction to the geometric problem of identifying common colors in two ranges containing colored points. we develop an i/o efficient algorithm for solving the common colors problem, and use it to obtain an i/o efficient (poly- logarithmic query time) algorithm for the two-dimensional substring indexing problem. our techniques result in a family of secondary memory index structures that trade space for time, with no loss of accuracy. we show how our technique can be practically realized using a combination of string b-trees and r-trees.  paolo ferragina nick koudas divesh srivastava s. muthukrishnan
load control for locking: the "half-and-half" approach  a number of concurrency control performance studies have shown that, under high levels of data contention, concurrency control algorithms can exhibit thrashing behavior which is detrimental to overall system performance. in this paper, we present an approach to eliminating thrashing in the case of two- phase locking, a widely used concurrency control algorithm. our solution, which we call the 'half-and-half' algorithm, involves monitoring the state of the dbms in order to dynamically control the multiprogramming level of the system. results from a performance study indicate that the half-and-half algorithm can be very effective at preventing thrashing under a wide range of operating conditions and workloads.  michael j. carey sanjay krishnamurthi miron livny
corrigenda: a hierarchy-aware approach to faceted classification of object- oriented components  this article presents a hierarchy-aware classification schema for object- oriented code, where software components are classified according to their behavioral characteristics, such as provided services, employed algorithms, and needed data. in the case of reusable application frameworks, these characteristics are constructed from their model, i.e., from the description of the abstract classes specifying both the framework structure and purpose. in conventional object libraries, the characteristics are extracted semiautomatically from class interfaces. characteristics are term pairs, weighted to represent "how well" they describe component behavior. the set of characteristics associated with a given component forms its software descriptor. a descriptor base is presented where descriptors are organized on the basis of structured relationships, such as similarity and composition. the classification is supported by a thesaurus acting as a language-independent unified lexicon. the descriptor base is conceived for developers who, besides conventionally browsing the descriptors hierarchy, can query the system, specifying a set of desired functionalities and getting a ranked set of adaptable candidates. user feedback is taken into account in order to progressively ameliorate the quality of the descriptors according to the views of the user community. feedback is made dependent of the user typology through a user profile. experimental results in terms of recall and precision of the retrieval mechanism against a sample code base are reported.  e. damiani m. g. fugini c. bellettini
a framework for information visualisation  in this paper we examine the issues involved in developing information visualisation systems and present a framework for their construction. the framework addresses the components which must be considered in providing effective visualisations. the framework is specified using a declarative object oriented language; the resulting object model may be mapped to a variety of graphical user interface development platforms. this provides general support to developers of visualisation systems. a prototype system exists which allows the investigation of alternative visualisations for a range of data sources.  jessie b. kennedy kenneth j. mitchell peter j. barclay
visual digests for news video libraries  the informedia digital video library contains over 2000 hours of video, growing at a rate of 15 hours per week. a good query engine is not sufficient for information retrieval because often the candidate result sets grow in number as the library grows. video digests summarize sets of stories from the library, providing users with a visual mechanism for interactive browsing and query refinement. these digests are generated dynamically under the direction of the user based on automatically derived metadata from the video library. three types of digests are discussed: vibe digests emphasizing word relationships, timelines showing trends against time, and maps showing geographic correlations. multiple digests can be combined into a single view or animated into a temporal presentation.  michael g. christel
transversing itemset lattices with statistical metric pruning  we study how to efficiently compute significant association rules according to common statistical measures such as a chi-squared value or correlation coefficient. for this purpose, one might consider to use of the apriori algorithm, but the algorithm needs major conversion, because none of these statistical metrics are anti-monotone, and the use of higher support for reducing the search space cannot guarantee solutions in its the search space. we here present a method of estimating a tight upper bound on the statistical metric associated with any superset of an itemset, as well as the novel use of the resulting information of upper bounds to prune unproductive supersets while traversing itemset lattices. experimental tests demonstrate the efficiency of this method.  shinichi morishita jun sese
multidatabase update issues  a formal model of data updates in a multidatabase environment is developed, and a theory of concurrency control in such an environment is presented. we formulate a correctness condition for the concurrency control mechanism and propose a protocol that allows concurrent execution of a set of global transactions in presence of local ones. this protocol ensures the consistency of the multidatabase and deadlock freedom. we use the developed theory to prove the protocol's correctness and discuss complexity issues of implementing the proposed protocol.  yuri breitbart avi silberschatz
o-o, what's happening to db2?  in this presentation, we will describe a collection of new object-relational features that have been added to ibm's db2 universal database (udb) system. the features to be described include support for structured types, object references, and hierarchies of typed tables and views. these features will be covered from the perspective of a database designer or end user. in addition to presenting the features presently available in db2 udb v5.2, which became available in fall 1998, we will discuss the expected evolution and impact of this technology over time.  m. carey d. chamberlin d. doole s. rielau n. mattos s. narayanan b. vance r. swagerman
an object-oriented data model for distributed office applications  the object-oriented paradigm is becoming very popular for database applications and several object-oriented dbmss have been developed. a basic notion in this paradigm is the inheritance hierarchy that allows the users to define objects and the associated operations starting from already defined objects. however, in database applications the inheritance hierarchy must provide a conceptual modeling function, in addition to the re-usability function. another important requirement is to provide support for data distribution in (possibly) heterogeneous environments. this means that object implementation may differ depending on the object location. this paper presents a model that decouples these two aspects, modeling vs implementation, by using the concept of abstract and implementation classes. an abstract class specifies properties and methods for a set of similar objects, like in other object-oriented data models. an abstract class is however independent of the object implementation and location. an implementation class defines the implementation of an abstract class. in our model an abstract class may have several implementations. this allows the user to provide different implementations for the same set of objects, without requiring the objects to change class.  e. bertino m. negri g. pelagatti l. sbattella