Contact The DL Team Contact Us | Switch to tabbed view

top of pageABSTRACT

We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be "10% of married people between age 50 and 60 have at least 2 cars". We deal with quantitative attributes by fine-partitioning the values of the attribute and then combining adjacent partitions as necessary. We introduce measures of partial completeness which quantify the information lost due to partitioning. A direct application of this technique can generate too many similar rules. We tackle this problem by using a "greater-than-expected-value" interest measure to identify the interesting rules in the output. We give an algorithm for mining such quantitative association rules. Finally, we describe the results of using this approach on a real-life dataset.
Advertisements



top of pageAUTHORS



Ramakrishnan Srikant Ramakrishnan Srikant

www.rsrikant.com
Bibliometrics: publication history
Publication years1994-2015
Publication count42
Citation Count9,465
Available for download24
Downloads (6 Weeks)235
Downloads (12 Months)2,901
Downloads (cumulative)41,437
Average downloads per article1,726.54
Average citations per article225.36
View colleagues of Ramakrishnan Srikant


Author image not provided  Rakesh Agrawal

No contact information provided yet.

Bibliometrics: publication history
Publication years1983-2016
Publication count174
Citation Count17,724
Available for download90
Downloads (6 Weeks)1,078
Downloads (12 Months)15,478
Downloads (cumulative)115,160
Average downloads per article1,279.56
Average citations per article101.86
View colleagues of Rakesh Agrawal

top of pageREFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

AIS93
 
AS94
BKSS90
 
HF95
 
HS95
 
JD88
 
MTV94
Heikki Marmila, Harmu Toivonen, and A. Inkeri Verkamo. Efficient algorithms for discovering association rules. In KDD-94: AAAI Workshop on Knowledge Discovery in Databases, pages 181- 192, Seattle, Washington, July 1994.
PCY95
 
PS91
 
SA95
 
SON95
 
ST95
Avi Silberschatz and Alexander Tuzhilin. On Subjective Measures of Interestingness in Knowledge Discovery. In Proc. of the First Int'l Conference on Knowledge Discovery and Data Mining, Montreal, Canada, August 1995.

top of pageCITED BY

417 Citations

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

top of pageINDEX TERMS

The ACM Computing Classification System (CCS rev.2012)

Note: Larger/Darker text within each node indicates a higher relevance of the materials to the taxonomic classification.

top of pagePUBLICATION

· Proceeding
Title SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data table of contents
Editor Jennifer Widom Stanford Univ., Stanford, CT
Pages 1-12
Publication Date1996-06-01 (yyyy-mm-dd)
Sponsors SIGACT ACM Special Interest Group on Algorithms and Computation Theory
SIGAI ACM Special Interest Group on Artificial Intelligence
SIGMOD ACM Special Interest Group on Management of Data
PublisherACM New York, NY, USA ©1996
ISBN: 0-89791-794-4 doi>10.1145/233269.233311
Conference MODInternational Conference on Management of Data MOD logo
Paper Acceptance Rate 47 of 290 submissions, 16%
Overall Acceptance Rate 1,104 of 5,662 submissions, 19%
Year Submitted Accepted Rate
SIGMOD '96 290 47 16%
SIGMOD '97 202 42 21%
SIGMOD '00 248 42 17%
SIGMOD '01 293 44 15%
SIGMOD '02 240 42 18%
SIGMOD '03 342 53 15%
SIGMOD '06 446 58 13%
SIGMOD '07 480 70 15%
SIGMOD '08 435 78 18%
SIGMOD '09 430 118 27%
SIGMOD '10 384 80 21%
SIGMOD '11 375 93 25%
SIGMOD '12 289 48 17%
SIGMOD '13 372 76 20%
SIGMOD '14 421 107 25%
SIGMOD '15 415 106 26%
Overall 5,662 1,104 19%
· Newsletter
Title ACM SIGMOD Record Homepage table of contents archive
Volume 25 Issue 2, June 1996
Chairmen T. H. Merrett McGill Univ.
Editors H. V. Jagadish
Inderpal Singh Mumick
Pages 1-12
Publication Date1996-06-01 (yyyy-mm-dd)
Sponsor SIGMOD ACM Special Interest Group on Management of Data
PublisherACM New York, NY, USA
ISSN: 0163-5808 doi>10.1145/235968.233311

APPEARS IN
Artificial Intelligence
Digital Content
Digital Content
Theory

top of pageREVIEWS


Reviews are not available for this item
Computing Reviews logo

top of pageCOMMENTS

Be the first to comment To Post a comment please sign in or create a free Web account

top of pageTable of Contents

Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Table of Contents
Mining quantitative association rules in large relational tables
Ramakrishnan Srikant, Rakesh Agrawal
Pages: 1-12
doi>10.1145/233269.233311
Full text: PDFPDF

We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be "10% of married people between age 50 and 60 have at least 2 cars". We ...
expand
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
Takeshi Fukuda, Yasukiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
Pages: 13-23
doi>10.1145/233269.233313
Full text: PDFPDF

We discuss data mining based on association rules for two numeric attributes and one Boolean attribute. For example, in a database of bank customers, "Age" and "Balance" are two numeric attributes, and "CardLoan" is a Boolean attribute. Taking the pair ...
expand
IDEA: interactive data exploration and analysis
Peter G. Selfridge, Divesh Srivastava, Lynn O. Wilson
Pages: 24-34
doi>10.1145/233269.233315
Full text: PDFPDF

The analysis of business data is often an ill-defined task characterized by large amounts of noisy data. Because of this, business data analysis must combine two kinds of intertwined tasks: exploration and analysis. Exploration is the process ...
expand
Rapid bushy join-order optimization with Cartesian products
Bennet Vance, David Maier
Pages: 35-46
doi>10.1145/233269.233317
Full text: PDFPDF

Query optimizers often limit the search space for join orderings, for example by excluding Cartesian products in subplans or by restricting plan trees to left-deep vines. Such exclusions are widely assumed to reduce optimization effort while minimally ...
expand
SQL query optimization: reordering for a general class of queries
Piyush Goel, Bala Iyer
Pages: 47-56
doi>10.1145/233269.233318
Full text: PDFPDF

The strength of commercial query optimizers like DB2 comes from their ability to select an optimal order by generating all equivalent reorderings of binary operators. However, there are no known methods to generate all equivalent reorderings for a SQL ...
expand
Fundamental techniques for order optimization
David Simmen, Eugene Shekita, Timothy Malkemus
Pages: 57-67
doi>10.1145/233269.233320
Full text: PDFPDF

Decision support applications are growing in popularity as more business data is kept on-line. Such applications typically include complex SQL queries that can test a query optimizer's ability to produce an efficient access plan. Many access plan strategies ...
expand
A Teradata content-based multimedia object manager for massively parallel architectures
W. O'Connell, I. T. Ieong, D. Schrader, C. Watson, G. Au, A. Biliris, S. Choo, P. Colin, G. Linderman, E. Panagos, J. Wang, T. Walter
Pages: 68-78
doi>10.1145/233269.233321
Full text: PDFPDF

The Teradata Multimedia Object Manager is a general-purpose content analysis multimedia server designed for symmetric multiprocessing and massively parallel processing environments. The Multimedia Object Manager defines and manipulates user-defined functions ...
expand
Fault-tolerant architectures for continuous media servers
Banu Özden, Rajeev Rastogi, Prashant Shenoy, Avi Silberschatz
Pages: 79-90
doi>10.1145/233269.233322
Full text: PDFPDF

Continuous media servers that provide support for the storage and retrieval of continuous media data (e.g., video, audio) at guaranteed rates are becoming increasingly important. Such servers, typically, rely on several disks to service a large number ...
expand
Optimizing queries over multimedia repositories
Surajit Chaudhuri, Luis Gravano
Pages: 91-102
doi>10.1145/233269.233323
Full text: PDFPDF

Repositories of multimedia objects having multiple types of attributes (e.g., image, text) are becoming increasingly common. A selection on these attributes will typically produce not just a set of objects, as in the traditional relational query model ...
expand
BIRCH: an efficient data clustering method for very large databases
Tian Zhang, Raghu Ramakrishnan, Miron Livny
Pages: 103-114
doi>10.1145/233269.233324
Full text: PDFPDF

Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely studied problems in this area is the identification of clusters, or densely populated regions, in a multi-dimensional dataset. Prior ...
expand
On-line reorganization of sparsely-populated B+-trees
Chendong Zou, Betty Salzberg
Pages: 115-124
doi>10.1145/233269.233325
Full text: PDFPDF

In this paper, we present an efficient method to do online reorganization of sparsely-populated B+-trees. It reorganizes the leaves first, compacting in short operations groups of leaves with the same parent. After compacting, optionally, ...
expand
Two techniques for on-line index modification in shared nothing parallel databases
Kiran J. Achyutuni, Edward Omiecinski, Shamkant B. Navathe
Pages: 125-136
doi>10.1145/233269.233326
Full text: PDFPDF

Whenever data is moved across nodes in the parallel database system, the indexes need to be modified too. Index modification overhead can be quite severe because there can be a large number of indexes on a relation. In this paper, we study two alternatives ...
expand
Query caching and optimization in distributed mediator systems
S. Adali, K. S. Candan, Y. Papakonstantinou, V. S. Subrahmanian
Pages: 137-146
doi>10.1145/233269.233327
Full text: PDFPDF

Query processing and optimization in mediator systems that access distributed non-proprietary sources pose many novel problems. Cost-based query optimization is hard because the mediator does not have access to source statistics information and furthermore ...
expand
Performance tradeoffs for client-server query processing
Michael J. Franklin, Björn Thór Jónsson, Donald Kossmann
Pages: 149-160
doi>10.1145/233269.233328
Full text: PDFPDF

The construction of high-performance database systems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectures that can fully exploit client and server resources in a flexible manner. ...
expand
Data access for the masses through OLE DB
José A. Blakeley
Pages: 161-172
doi>10.1145/233269.233329
Full text: PDFPDF

This paper presents an overview of OLE DB, a set of interfaces being developed at Microsoft whose goal is to enable applications to have uniform access to data stored in DBMS and non-DBMS information containers. Applications will be able to take advantage ...
expand
The dangers of replication and a solution
Jim Gray, Pat Helland, Patrick O'Neil, Dennis Shasha
Pages: 173-182
doi>10.1145/233269.233330
Full text: PDFPDF

Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up: a ten-fold increase in nodes and traffic gives a thousand fold increase in deadlocks or reconciliations. Master copy replication (primary copy) ...
expand
Hot mirroring: a method of hiding parity update penalty and degradation during rebuilds for RAID5
Kazuhiko Mogi, Masaru Kitsuregawa
Pages: 183-194
doi>10.1145/233269.233331
Full text: PDFPDF

This paper proposes a storage management scheme for disk arrays, named hot mirroring. In this scheme, storage space is partitioned into two regions. One is the mirrored region, which is characterized by high performance and low storage efficiency. The ...
expand
Random I/O scheduling in online tertiary storage systems
Bruce K. Hillyer, Avi Silberschatz
Pages: 195-204
doi>10.1145/233269.233332
Full text: PDFPDF

New database applications that require the storage and retrieval of many terabytes of data are reaching the limits for disk-based storage systems, in terms of both cost and scalability. These limits provide a strong incentive for the development of databases ...
expand
Implementing data cubes efficiently
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman
Pages: 205-216
doi>10.1145/233269.233333
Full text: PDFPDF

Decision support applications involve complex queries on very large databases. Since response times should be small, query optimization is critical. Users typically view the data as multidimensional data cubes. Each cell of the data cube is a view consisting ...
expand
Providing better support for a class of decision support queries
Sudhir G. Rao, Antonio Badia, Dirk van Gucht
Pages: 217-227
doi>10.1145/233269.233334
Full text: PDFPDF

Relational database systems do not effectively support complex queries containing quantifiers (quantified queries) that are increasingly becoming important in decision support applications. Generalized quantifiers provide an effective way ...
expand
A query language for multidimensional arrays: design, implementation, and optimization techniques
Leonid Libkin, Rona Machlin, Limsoon Wong
Pages: 228-239
doi>10.1145/233269.233335
Full text: PDFPDF

While much recent research has focussed on extending databases beyond the traditional relational model, relatively little has been done to develop database tools for querying data organized in (multidimensional) arrays. The scientific computing community ...
expand
A super scalar sort algorithm for RISC processors
Ramesh C. Agarwal
Pages: 240-246
doi>10.1145/233269.233336
Full text: PDFPDF

The compare and branch sequences required in a traditional sort algorithm can not efficiently exploit multiple execution units present in currently available high performance RISC processors. This is because of the long latency of the compare instructions ...
expand
Spatial hash-joins
Ming-Ling Lo, Chinya V. Ravishankar
Pages: 247-258
doi>10.1145/233269.233337
Full text: PDFPDF

We examine how to apply the hash-join paradigm to spatial joins, and define a new framework for spatial hash-joins. Our spatial partition functions have two components: a set of bucket extents and an assignment function, which may map a data item into ...
expand
Partition based spatial-merge join
Jignesh M. Patel, David J. DeWitt
Pages: 259-270
doi>10.1145/233269.233338
Full text: PDFPDF

This paper describes PBSM (Partition Based Spatial-Merge), a new algorithm for performing spatial join operation. This algorithm is especially effective when neither of the inputs to the join have an index on the joining attribute. Such a situation could ...
expand
Bifocal sampling for skew-resistant join size estimation
Sumit Ganguly, Phillip B. Gibbons, Yossi Matias, Avi Silberschatz
Pages: 271-281
doi>10.1145/233269.233340
Full text: PDFPDF

This paper introduces bifocal sampling, a new technique for estimating the size of an equi-join of two relations. Bifocal sampling classifies tuples in each relation into two groups, sparse and dense, based on the number of tuples with the same ...
expand
Estimating alphanumeric selectivity in the presence of wildcards
P. Krishnan, Jeffrey Scott Vitter, Bala Iyer
Pages: 282-293
doi>10.1145/233269.233341
Full text: PDFPDF

Success of commercial query optimizers and database management systems (object-oriented or relational) depend on accurate cost estimation of various query reordering [BGI]. Estimating predicate selectivity, or the fraction of rows in a database that ...
expand
Improved histograms for selectivity estimation of range predicates
Viswanath Poosala, Peter J. Haas, Yannis E. Ioannidis, Eugene J. Shekita
Pages: 294-305
doi>10.1145/233269.233342
Full text: PDFPDF

Many commercial database systems maintain histograms to summarize the contents of relations and permit efficient estimation of query result sizes and access plan costs. Although several types of histograms have been proposed in the past, there has never ...
expand
Structures for manipulating proposed updates in object-oriented databases
Michael Doherty, Richard Hull, Mohammed Rupawalla
Pages: 306-317
doi>10.1145/233269.233344
Full text: PDFPDF

Support for virtual states and deltas between them is useful for a variety of database applications, including hypothetical database access, version management, simulation, and active databases. The Heraclitus paradigm elevates delta values to be "first-class ...
expand
Safe and efficient sharing of persistent objects in Thor
B. Liskov, A. Adya, M. Castro, S. Ghemawat, R. Gruber, U. Maheshwari, A. C. Myers, M. Day, L. Shrira
Pages: 318-329
doi>10.1145/233269.233346
Full text: PDFPDF

Thor is an object-oriented database system designed for use in a heterogeneous distributed environment. It provides highly-reliable and highly-available persistent storage for objects, and supports safe sharing of these objects by applications written ...
expand
An open abstract-object storage system
Stephen Blott, Lukas Relly, Hans-Jörg Schek
Pages: 330-340
doi>10.1145/233269.233348
Full text: PDFPDF

Database systems must become more open to retain their relevance as a technology of choice and necessity. Openness implies not only databases exporting their data, but also exporting their services. This is as true in classical application areas as in ...
expand
Static detection of security flaws in object-oriented databases
Keishi Tajima
Pages: 341-352
doi>10.1145/233269.233349
Full text: PDFPDF

Access control in function granularity is one of the features of many object-oriented databases. In those systems, the users are granted rights to invoke composed functions instead of rights to invoke primitive operations. Although primitive operations ...
expand
Goal-oriented buffer management revisited
Kurt P. Brown, Michael J. Carey, Miron Livny
Pages: 353-364
doi>10.1145/233269.233351
Full text: PDFPDF

In this paper we revisit the problem of achieving multi-class workload response time goals by automatically adjusting the buffer memory allocations of each workload class. We discuss the virtues and limitations of previous work with respect to a set ...
expand
Multi-dimensional resource scheduling for parallel queries
Minos N. Garofalakis, Yannis E. Ioannidis
Pages: 365-376
doi>10.1145/233269.233352
Full text: PDFPDF

Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution environment, where each system node represents a collection of time-shareable ...
expand
Semi-automatic, self-adaptive control of garbage collection rates in object databases
Jonathan E. Cook, Artur W. Klauser, Alexander L. Wolf, Benjamin G. Zorn
Pages: 377-388
doi>10.1145/233269.233354
Full text: PDFPDF

A fundamental problem in automating object database storage reclamation is determining how often to perform garbage collection. We show that the choice of collection rate can have a significant impact on application performance and that the "best" rate ...
expand
Towards effective and efficient free space management
Mark L. McAuliffe, Michael J. Carey, Marvin H. Solomon
Pages: 389-400
doi>10.1145/233269.233355
Full text: PDFPDF

An important problem faced by many database management systems is the "online object placement problem"--the problem of choosing a disk page to hold a newly allocated object. In the absence of clustering criteria, the goal is to maximize storage utilization. ...
expand
Rule languages and internal algebras for rule-based optimizers
Mitch Cherniack, Stanley B. Zdonik
Pages: 401-412
doi>10.1145/233269.233356
Full text: PDFPDF

Rule-based optimizers and optimizer generators use rules to specify query transformations. Rules act directly on query representations, which typically are based on query algebras. But most algebras complicate rule formulation, and rules over these algebras ...
expand
Evaluating queries with generalized path expressions
Vassilis Christophides, Sophie Cluet, Guido Moerkotte
Pages: 413-422
doi>10.1145/233269.233358
Full text: PDFPDF

In the past few years, query languages featuring generalized path expressions have been proposed. These languages allow the interrogation of both data and structure. They are powerful and essential for a number of applications. However, until now, their ...
expand
Query execution techniques for caching expensive methods
Joseph M. Hellerstein, Jeffrey F. Naughton
Pages: 423-434
doi>10.1145/233269.233359
Full text: PDFPDF

Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods are run on data with duplicate values, time is wasted redundantly computing methods ...
expand
Cost-based optimization for magic: algebra and implementation
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pirahesh, T. Y. Cliff Leung, Raghu Ramakrishnan, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan
Pages: 435-446
doi>10.1145/233269.233360
Full text: PDFPDF

Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which differ greatly in execution performance. We propose cost-based techniques for ...
expand
Materialized view maintenance and integrity constraint checking: trading space for time
Kenneth A. Ross, Divesh Srivastava, S. Sudarshan
Pages: 447-458
doi>10.1145/233269.233361
Full text: PDFPDF

We investigate the problem of incremental maintenance of an SQL view in the face of database updates, and show that it is possible to reduce the total time cost of view maintenance by materializing (and maintaining) additional views. We formulate the ...
expand
Maintaining database consistency in presence of value dependencies in multidatabase systems
Claire Morpain, Michéle Cart, Jean Ferrié, Jean-François Pons
Pages: 459-468
doi>10.1145/233269.233362
Full text: PDFPDF

The emergence of new criteria specifically adapted to multidatabase systems, in response to constraints imposed by global serializability, leads to restrictive hypotheses in order to ensure correctness of executions. This is the case with the two ...
expand
Algorithms for deferred view maintenance
Latha S. Colby, Timothy Griffin, Leonid Libkin, Inderpal Singh Mumick, Howard Trickey
Pages: 469-480
doi>10.1145/233269.233364
Full text: PDFPDF

Materialized views and view maintenance are important for data warehouses, retailing, banking, and billing applications. We consider two related view maintenance problems: 1) how to maintain views after the base tables have already been modified, and ...
expand
A framework for supporting data integration using the materialized and virtual approaches
Richard Hull, Gang Zhou
Pages: 481-492
doi>10.1145/233269.233365
Full text: PDFPDF

This paper presents a framework for data integration currently under development in the Squirrel project. The framework is based on a special class of mediators, called Squirrel integration mediators. These mediators can support the traditional ...
expand
Change detection in hierarchically structured information
Sudarshan S. Chawathe, Anand Rajaraman, Hector Garcia-Molina, Jennifer Widom
Pages: 493-504
doi>10.1145/233269.233366
Full text: PDFPDF

Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in change management has dealt with flat-file and relational data; we focus ...
expand
A query language and optimization techniques for unstructured data
Peter Buneman, Susan Davidson, Gerd Hillebrand, Dan Suciu
Pages: 505-516
doi>10.1145/233269.233368
Full text: PDFPDF

A new kind of data model has recently emerged in which the database is not constrained by a conventional schema. Systems like ACeDB, which has become very popular with biologists, and the recent Tsimmis proposal for data integration organize data in ...
expand
Is GUI programming a database research problem?
Nita Goyal, Charles Hoch, Ravi Krishnamurthy, Brian Meckler, Michael Suckow
Pages: 517-528
doi>10.1145/233269.233369
Full text: PDFPDF

Programming nontrivial GUI applications is currently an arduous task. Just as the use of a declarative language simplified the programming of database applications, we ask whether we can do the same for GUI programming? Can we then import a large body ...
expand
Accessing relational databases from the World Wide Web
Tam Nguyen, V. Srinivasan
Pages: 529-540
doi>10.1145/233269.233371
Full text: PDFPDF

With the growing popularity of the internet and the World Wide Web (Web), there is a fast growing demand for access to database management systems (DBMS) from the Web. We describe here techniques that we invented to bridge the gap between HTML, the standard ...
expand
The ins and outs (and everything in between) of data warehousing
Phil Fernandez, Donovan Schneider
Page: 541
doi>10.1145/233269.280347
Full text: PDFPDF
Repository system engineering
Pillip A. Bernstein
Page: 542
doi>10.1145/233269.280348
Full text: PDFPDF
databases and visualization
Daniel A. Keim
Page: 543
doi>10.1145/233269.280349
Full text: PDFPDF
State of the art in workflow management research and products
C. Mohan
Page: 544
doi>10.1145/233269.280350
Full text: PDFPDF

In the last few years, workflow management has become a hot topic in the research community and, especially, in the commercial arena. Workflow management is multidisciplinary in nature encompassing many aspects of computing: database management, distributed ...
expand
Data mining techniques
Jiawei Han
Page: 545
doi>10.1145/233269.280351
Full text: PDFPDF

Data mining, or knowledge discovery in databases, has been popularly recognized as an important research issue with broad applications. We provide a comprehensive survey, in database perspective, on the data mining techniques developed recently. Several ...
expand
Thinksheet: a tool for tailoring complex documents
Peter Piatko, Roman Yangarber, Daoi Lin, Dennis Shasha
Page: 546
doi>10.1145/233269.280352
Full text: PDFPDF
HyperStorM—administering structured documents using object-oriented database technology
Klemens Böhm, Karl Aberer
Page: 547
doi>10.1145/233269.280353
Full text: PDFPDF
DBSim: a simulation tool for predicting database performance
Mark Lefler, Mark Stokrp, Craig Wong
Page: 548
doi>10.1145/233269.280354
Full text: PDFPDF
LORE: a Lightweight Object REpository for semistructured data
Dallan Quass, Jennifer Widom, Roy Goldman, Kevin Haas, Qingshan Luo, Jason McHugh, Svetlozar Nestorov, Anand Rajaraman, Hugo Rivero, Serge Abiteboul, Jeff Ullman, Janet Wiener
Page: 549
doi>10.1145/233269.280355
Full text: PDFPDF
DBMiner: interactive mining of multiple-level knowledge in relational databases
Jaiwei Han, Youngjian Fu, Wei Wang, Jenny Chiang, Osmar R. Zaïane, Krzysztof Koperski
Page: 550
doi>10.1145/233269.280356
Full text: PDFPDF

Based on our years-of-research, a data mining system, DB-Miner, has been developed for interactive mining of multiple-level knowledge in large relational databases. The system implements a wide spectrum of data mining functions, including generalization, ...
expand
prospector: a content-based multimedia server for massively parallel architectures
S. Choo, W. O'Connell, G. Linerman, H. Chen, K. Ganapathy, A. Biliris, E. Panagos, D. Schrader
Page: 551
doi>10.1145/233269.280357
Full text: PDFPDF

The Prospector Multimedia Object Manager prototype is a general-purpose content analysis multimedia server designed for massively parallel processor environments. Prospector defines and manipulates user defined functions which are invoked in parallel ...
expand
METU interoperable database system
Asuman Dogac, Ugur Halici, Ebru Kilic, Gokhan Ozhan, Fatma Ozcan, Sena Nural, Cevdet Dengi, Sema Mancuhan, Budak Arpinar, Pinar Koksal, Cem Evrendilek
Page: 552
doi>10.1145/233269.280358
Full text: PDFPDF
SONAR: system for optimized numeric association rules
Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita, Takeshi Tokuyama
Page: 553
doi>10.1145/233269.280359
Full text: PDFPDF
CapBasED-AMS: a capability-based and event-driven activity management system
Patrick C. K. Hung, Helen P. Yeung, Kamalakar Karlapalem
Page: 554
doi>10.1145/233269.280360
Full text: PDFPDF
The MultiView project: object-oriented view technology and applications
E. A. Rundensteiner, H. A. Kuno, Y.-G. Ra, V. Crestana-Taube, M. C. Jones, P. J. Marron
Page: 555
doi>10.1145/233269.280361
Full text: PDFPDF
BeSS: storage support for interactive visualization systems
A. Biliris, T. A. Funkhouser, W. O'Connell, E. Panagos
Page: 556
doi>10.1145/233269.280362
Full text: PDFPDF
The Garlic project
M. Tork Roth, M. Arya, L. Haas, M. Carey, W. Cody, R. Fagin, P. Schwarz, J. Thomas, E. Wimmers
Page: 557
doi>10.1145/233269.280363
Full text: PDFPDF

The goal of the Garlic [1] project is to build a multimedia information system capable of integrating data that resides in different database systems as well as in a variety of non-database data servers. This integration must be enabled while maintaining ...
expand

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2016 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Reader    QuickTime    Windows Media Player    Real Player
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder