This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
579 Mining Association Rules between Sets of Items in Large Databases - Agrawal, Imielinski, Swami (1993)(Correct)
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant associat... / In Section we present some performance results showing the br between Sets of Items in Large Databases Rakesh Agrawal Tomasz
488 Fast Algorithms for Mining Association Rules - Agrawal, Srikant (1994)(Correct)
We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally differen... / the earlier algorithms. The performance gap is shown to increase with br rules between items in a large database of sales transactions. We
426 Bagging Predictors - Breiman (1996)(Correct)
Bagging predictors is a method for generating multiple versions of a predictor and using these to get an aggregated predictor. The aggregation averages over the versions when predicting a numerical ou... / hand it can slightly degrade the performance of stable procedures. There br ics.uci.edu pub machine-learning-databases The data are briefly described
259 The Object-Oriented Database System Manifesto - Atkinson, Bancilhon, DeWitt.. (1989)(Correct)
This paper attempts to define an object-oriented database system. It describes the main features and characteristics that a system must have to qualify as an objectoriented database system. We have se... / and that can provide the high-performance dictated by interactive br The Object-Oriented Database System Manifesto Malcolm
259 Efficient Software-Based Fault Isolation - Wahbe, Lucco, Anderson, Graham (1993)(Correct)
One way to provide fault isolation among cooperating software modules is to place each in its own address space. However, for tightly-coupled modules, this solution incurs prohibitive context switch o... / improve end-to-end application performance. This work was supported in br For example the postgres database manager includes an extensible
209 View-Based and Modular Eigenspaces for Face Recognition - Pentland, Moghaddam, Starner (1994)(Correct)
In this work we describe experiments with eigenfaces for recognition and interactive search in a large-scale face database. Accurate visual recognition is demonstrated using a database of O(10^3) face... / faces. Thus how face recognition performance scales with the number of br search in a large-scale face database. Accurate visual recognition is
202 Answering Queries Using Views - Levy, Mendelzon, Sagiv, Srivastava (1995)(Correct)
Alon Y. Levy
AT&T Bell Laboratories
levy@research.att.com
Alberto O. Mendelzon
University of Toronto
mendel@db.toronto.edu
Yehoshua Sagiv
y
Hebrew University, Jerusalem
sagiv@cs.huji.ac.il
Di... / from its potential of improving performance of query evaluation LY br that mention as few of the database relations as possible are
201 SIS: A System for Sequential Circuit Synthesis - Sentovich, Singh, Lavagno, Moon.. (1992)(Correct)
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a
signal transition graph, or a logic-level description of a sequential circuit, it pr... / optimization is done for area performance and testability. System-level br tool set based on the Oct database. While MISII operated on only
188 Implementing Data Cubes Efficiently - Harinarayan, Rajaraman, Ullman (1996)(Correct)
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
d... / are many ways to achieve such performance goals. Query optimizers and br complex queries on very large databases. Since response times should be
185 Mining Generalized Association Rules - Srikant, Agrawal (1995)(Correct)
We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (is-a hierarchy) on the item... / in Section and evaluate their performance on both synthetic and br association rules. Given a large database of transactions where each
174 Mining Sequential Patterns - Agrawal, Srikant (1995)(Correct)
We are given a large database of customer transactions, where each transaction consists of customer-id, transaction time, and the items bought in the transaction. We introduce the problem of mining se... / and empirically evaluate their performance using synthetic data. Two of br Abstract We are given a large database of customer transactions where
170 KIDS: A Semi-Automatic Program Development System - Smith (1990)(Correct)
The Kestrel Interactive Development System (KIDS) provides automated support for the development of correct and efficient programs from formal specifications. The system has components for performing ... / optimization techniques performance analysis etc. We report here br ffl an object-attribute-style database that is used to represent
158 Multidimensional Access Methods - Gaede, Günther (1997)(Correct)
Search operations in databases require some special support at the physical
level. This is true for conventional databases as well as for spatial databases, where
typical search operations include the... / results concerning the relative performance of various approaches. br Abstract Search operations in databases require some special support at
155 Neural Network-Based Face Detection - Rowley, Baluja, Kanade (1996)(Correct)
We present a neural network-based face detection
system. A retinally connected neural network examines
small windows of an image, and decides
whether each window contains a face. The system
arbitrates... / multiple networks to improve performance over a single network. We use a br examples were gathered from face databases at CMU and Harvard
150 Boosting the Margin: A New Explanation for the Effectiveness of.. - Schapire, Freund, al. (1997)(Correct)
One of the surprising recurring phenomena
observed in experiments with boosting is that the test error
of the generated hypothesis usually does not increase as its
size becomes very large, and often... / significant improvements in the performance of decision-tree learning br are part of the StatLog database which can be retrieved
145 Agile Application-Aware Adaptation for Mobility - Noble (1997)(Correct)
In this paper we show that application-aware adaptation, a collaborative partnership between the operating system and applications, offers the most general and effective approach to mobile information... / of Odyssey indicating performance improvements up to a factor of br libraries query-by-image-content databases or back ends of geographical
133 Totem: A Fault-Tolerant Multicast Group Communication System - Moser, Melliar-Smith, Agarwal.. (1996)(Correct)
When Totem delivers multicast messages, it invokes operations in the same total
order throughout the distributed system. The result: consistency of replicated
data and simplified programming of applic... / on several processors to improve performance and to provide fault br medical monitoring and replicated database systems. The characteristics
132 Fast Subsequence Matching in Time-Series Databases - Faloutsos, Ranganathan, Manolopoulos (1994)(Correct)
We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The... / can be used. Section discusses performance results obtained from br Matching in Time-Series Databases Christos Faloutsos M.
132 Informed Prefetching and Caching - Patterson, Gibson, Ginting.. (1995)(Correct)
In this paper, we present aggressive, proactive mechanisms that tailor file system resource management to the needs of I/O-intensive applications. In particular, we show how to use application-disclos... / operating system and measured its performance on a MHz Alpha equipped br visualization relational database queries speech recognition and
132 Broadcast Disks: Data Management for Asymmetric Communication.. - Acharya (1995)(Correct)
This paper proposes the use of repetitive broadcast as a way of augmenting the memory hierarchy of clients in an asymmetric communication environment. We describe a new technique called "Broadcast Dis... / in a way that provides improved performance for non-uniformly accessed br earlier work on broadcast-based database systems such as
126 The Design Of Postgres - Stonebraker, Rowe (1986)(Correct)
This paper presents the preliminary design of a new database management system, called POSTGRES, that is the successor to the INGRES relational database system. The main design goals of the new system... / on a relational system the performance of the applications is br the preliminary design of a new database management system called
123 Visual Information Seeking: Tight Coupling of Dynamic Query Filters.. - Ahlberg, Shneiderman (1994)(Correct)
This paper offers new principles for visual information seeking (VIS). A key concept is to support browsing, which is distinguished from familiar query composition and information retrieval because of... / demonstrated dramatic performance improvements and high levels of br FilmFinder prototype using a movie database demonstrates these principles in
122 A High Performance Totally Ordered Multicast Protocol - Whetten, Kaplan, Montgomery (1994)(Correct)
This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast
service on top of an unreliable multicast datagram service such as IP Multicasting... / A High Performance Totally Ordered Multicast br systems and distributed databases Chang New applications such
120 Using Linear Algebra for Intelligent Information Retrieval - Berry, Dumais, O'Brien (1995)(Correct)
Currently, most approaches to retrieving textual materials from scientific databases depend on a lexical match between words in users' requests and those in or assigned to documents in a database. B... / obtained from the truncated SVD. Performance data shows that these br textual materials from scientific databases depend on a lexical match
118 The Zebra Striped Network File System - Hartman, Ousterhout (1993)(Correct)
Zebra is a network file system that increases throughput by striping file data across multiple servers. Rather than striping each file separately, Zebra forms all the new data from each client into a ... / file system. This provides high performance for writes of small files as br may not be suitable for running database applications which tend to
117 DataGuides: Enabling Query Formulation and Optimization in.. - Goldman, Widom (1997)(Correct)
In semistructured databases there is no schema fixed in advance. To provide the benefits of a schema in such environments, we introduce DataGuides: concise and accurate structural summaries of semistr... / maintenance. We provide performance results based on our br Optimization in Semistructured Databases Roy Goldman Stanford
113 MediaBench: A Tool for Evaluating and Synthesizing Multimedia and.. - Lee (1997)(Correct)
Over the last decade, significant advances have been made in compilation technology for capitalizing on instruction-level parallelism (ILP). The vast majority of ILP compilation research has been cond... / Windows applications network performance and I O. However no effective br desktop computing systems Database systems are typically evaluated
111 Cluster-Based Scalable Network Services - Fox, Gribble, Chawathe, Brewer.. (1997)(Correct)
This paper has benefited from the detailed and perceptive comments of our reviewers, especially our shepherd Hank Levy. We thank Randy Katz and Eric Anderson for their detailed readings of early draft... / of Internet content. For both performance and implementation simplicity br of queries per day against a database of over million web pages.
109 Efficient Similarity Search In Sequence Databases - Agrawal (1993)(Correct)
We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation b... / are adequate to provide good performance. The performance gain of our br Similarity Search In Sequence Databases Rakesh Agrawal and Christos
105 On the Computation of Multidimensional Aggregates - Agarwal, Agrawal, Deshpande, Gupta.. (1996)(Correct)
At the heart of all OLAP or multidimensional
data analysis applications is the ability to simultaneously
aggregate across many sets of
dimensions. Computing multidimensional aggregates
is a performanc... / multidimensional aggregates is a performance bottleneck for these br time in seconds possible OLAP databases often precompute aggregates at
94 SPRINT: A Scalable Parallel Classifier for Data Mining - Shafer, Agrawal, Mehta (1996)(Correct)
Classification is an important data mining
problem. Although classification is a wellstudied
problem, most of the current classification
algorithms require that all or a portion
of the the entire data... / SLIQ. In Section we give a performance evaluation of the serial and br suitability for mining over large databases. We present a new
93 Mining Sequential Patterns: Generalizations And Performance.. - Srikant, Agrawal (1996)(Correct)
The problem of mining sequential patterns was recently introduced in [AS95]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each... / Patterns Generalizations And Performance Improvements Ramakrishnan br in AS We are given a database of sequences where each sequence
93 Efficient Algorithms for Discovering Association Rules - Mannila, Toivonen, Verkamo (1994)(Correct)
Association rules are statements of the form "for 90 % of the rows of the relation, if the row has value 1 in the columns in set W , then it has 1 also in column B". Agrawal, Imielinski, and Swami int... / results show a good solid performance for our method. A same type of br on Knowledge Discovery in Databases Eds. Usama M. Fayyad and
93 Locality-Aware Request Distribution in Cluster-based Network Servers - Pai (1998)(Correct)
We consider cluster-based network servers in which a front-end directs incoming requests to one of a number of back-ends. Specifically, we consider content-based request distribution: the front-end us... / demonstrate substantial performance improvements over br by partitioning the server's database and provide the ability to
91 Greedy Attribute Selection - Caruana, Freitag (1994)(Correct)
Many real-world domains bless us with a wealth
of attributes to use for learning. This blessing is
often a curse: most inductive methods generalize
worse given too many attributes than if given a
goo... / improvements in generalization performance. We present a caching scheme br run on an accumulating database of previously scheduled meetings
90 Tabled Evaluation with Delaying for General Logic Programs - Chen, Warren (1996)(Correct)
SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Desp... / body leading to unacceptable performance. We address all three problems br ACM Symposium on Principles of Database Systems. ACM Washington
89 Dealing With Disaster: Surviving Misbehaved Kernel Extensions - Seltzer (1996)(Correct)
Today's extensible operating systems allow applications
to modify kernel behavior by providing mechanisms for
application code to run in the kernel address space. The
advantage of this approach is tha... / application flexibility and performance the disadvantage is that br in a wide range of systems. Database clients might extend their server
89 Extended Virtual Synchrony - Moser, Amir, Melliar-Smith, Agarwal (1994)(Correct)
We formulate a model of extended virtual synchrony that defines a group communication
transport service for multicast and broadcast communication in a distributed
system. The model extends the virtual... / destinations. To achieve better performance advanced protocols exploit the br records each transaction in its database checking that cumulative
85 Infomaster: An Information Integration System - Genesereth, Keller, Duschka (1997)(Correct)
Infomaster is an information integration system that provides
integrated access to multiple distributed heterogeneous
information sources on the Internet, thus giving the illusion
of a centralized, ho... / Data may however be cached for performance reasons.The next section br connects to a variety of databases using wrappers such as for
81 Application-Controlled Physical Memory using External Page-Cache.. - Harty (1992)(Correct)
Next generation computer systems will have gigabytes
of physical memory and processors in the 200 MIPS range
or higher. While this trend suggests that memory management
for most programs will be less ... / can significantly improve performance for many memory-bound br as scientific simulations and database management systems will require
81 Generalizing GlOSS to Vector-Space Databases and Broker Hierarchies - Gravano, Garcia-Molina (1995)(Correct)
As large numbers of text databases have become
available on the Internet, it is harder to
locate the right sources for given queries. In
this paper we present gGlOSS, a generalized
Glossary-Of-Server... / ranks. For this we evaluate the performance of gGlOSS using real-user br GlOSS to Vector-Space Databases and Broker Hierarchies
81 Petal: Distributed Virtual Disks - Edward Lee (1996)(Correct)
The ideal storage system is globally accessible, always available,
provides unlimited performance and capacity for a large number
of clients, and requires no management. This paper describes
the desig... / available provides unlimited performance and capacity for a large number br Clients such as file systems and databases view Petal as a collection of
80 Practical Prefetching via Data Compression - Curewitz, Krishnan, Vitter (1993)(Correct)
An important issue that affects response time performance
in current OODB and hypertext systems is the I/O involved
in moving objects from slow memory to cache. A promising
way to tackle this problem ... / issue that affects response time performance in current OODB and hypertext br cache in the background. Current databases perform limited prefetching
80 Incremental Recomputation of Active Relational Expressions - Qian (1991)(Correct)
Database updates are small and incremental compared to database contents. It is therefore desirable that recomputations of active relational expressions -- such as views, derived data, integrity const... / and can cause failure to meet performance requirements. The major reason br and Gio Wiederhold Abstract-Database updates are small and incremental
80 Exploiting Style in Architectural Design Environments - Garlan, Allen, Ockerbloom (1994)(Correct)
As the design of software architectures emerges as a discipline
within software engineering, it will become increasingly important
to support architectural description and analysis with tools and
envi... / distribution scaling and performance dimensions of evolution and br style-specific environments databases tool integration frameworks
79 GLIMPSE: A Tool to Search Through Entire File Systems - Manber (1994)(Correct)
GLIMPSE, which stands for GLobal IMPlicit SEarch, provides indexing and query schemes for file systems. The
novelty of glimpse is that it uses a very small index --- in most cases 2-4% of the size of ... / that with current computing performance sequential search is fast br drawback for commercial text databases because disk space is
79 Scout: A Communications-Oriented Operating System - Montz, Mosberger, O'Malley.. (1994)(Correct)
This white paper describes Scout, a new operating system being designed for systems connected to the National Information Infrastructure (NII). Scout provides a communication-oriented software archite... / has both predictable and scalable performance. June Department br or an application-specific database. As another example a network
78 SLIQ: A Fast Scalable Classifier for Data Mining - Mehta, Agrawal, Rissanen (1996)(Correct)
Classification is an important problem in the emerging field
of data mining. Although classification has been studied extensively in
the past, most of the classification algorithms are designed only... / present the design and a detailed performance analysis of SLIQ respectively. br Mining or Knowledge Discovery in Databases is a testimony to this trend.
78 A Digital Fountain Approach to Reliable Distribution of Bulk Data - Byers, Luby, Mitzenmacher, Rege (1998)(Correct)
The proliferation of applications that must reliably distribute bulk data to a large number of
autonomous clients motivates the design of new multicast and broadcast protocols. We describe
an ideal, f... / erasure codes. We provide performance measurements that demonstrate br video and financial information database replication and popular web site
78 Locating Nearby Copies of Replicated Internet Servers - Guyton, Schwartz (1995)(Correct)
In this paper we consider the problem of choosing among a collection of replicated servers,
focusing on the question of how to make choices that segregate client/server traffic according
to network to... / time which would suffer the same performance problems as using multicast br to those that build location databases using application-level probe
78 Partition Based Spatial-Merge Join - Patel, DeWitt (1996)(Correct)
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... / This paper also presents a performance study comparing the the br of these algorithms in Paradise a database system for handling GIS
76 A predicate-based caching scheme for client-server database.. - Keller, Basu (1996)(Correct)
F3.733e+05> We propose a new client-side data-caching scheme
for relational databases with a central server and multiple
clients. Data are loaded into each client cache based on
queries executed on ... / database. We examine the various performance tradeoffs and optimization br caching scheme for client-server database architectures Arthur M. Keller
76 Accessing Nearby Copies of Replicated Objects in a Distributed.. - Plaxton, Rajaraman, Richa (1997)(Correct)
Consider a set of shared objects in a distributed network, where several copies of each object
may exist at any given time. To ensure both fast access to the objects as well as efficient
utilization o... / to any interesting measure of performance e.g.latency throughput br the emergence of large distributed databases such as the World Wide Web. The
76 A Continuous Media Player - Rowe, Smith (1992)(Correct)
The design and implementation of a continuous media player for Unix workstations
is described. The player can play synchronized digital video and audio read
from a file server. The system architectu... / and results of preliminary performance experiments are presented. br quality videos stored in a large database on a shared file server. Figure
75 SIFT - A Tool for Wide-Area Information Dissemination - Yan (1995)(Correct)
The dissemination model is becoming increasingly
important in wide-area information system. In this
model, the user subscribes to an information dissemination
service by submitting profiles that descr... / an empirical study of SIFT's performance examining its main memory br the entire append-only document database. Efficient query processing
75 Interval-Based Conceptual Models for Time-Dependent Multimedia Data - Little, Ghafoor (1993)(Correct)
Multimedia data often have time dependencies that must be satisfied at presentation
time. To support a general-purpose multimedia information system, these timing
relationships must be managed to prov... / MDBMS must also accommodate the performance limitations of the computer. br and managing them as part of a database. Specifically we introduce and
73 Online Aggregation - Hellerstein, Haas, Wang (1997)(Correct)
Aggregation in traditional database systems is performed in
batch mode: a query is submitted, the system processes a
large volume of data over a long period of time, and, eventually,
the final answer ... / After outlining usability and performance requirements for a system br Aggregation in traditional database systems is performed in batch
73 View-Dependent Simplification Of Arbitrary Polygonal Environments - Luebke, Erikson(Correct)
Hierarchical dynamic simplification (HDS) is a new approach to
the problem of simplifying arbitrary polygonal environments.
HDS operates dynamically, retessellating the scene continuously
as the user'... / dial for trading off performance and fidelity. This final br adaptively processing the entire database without first decomposing the
72 Semantic Data Caching and Replacement - Dar, Franklin, Jónsson.. (1996)(Correct)
We propose a semantic model for client-side caching and replacement
in a client-server database system and compare this approach
to page caching and tuple caching strategies. Our caching model
is base... / these ideas with a detailed performance study that includes traditional br replacement in a client-server database system and compare this approach
71 Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy, Vengroff.. (1993)(Correct)
We examine I/O-efficient data structures that provide indexing support for new data models. The database languages of these models include concepts from constraint programming (e.g., relational tuples... / algorithm with good worst-case performance for the class indexing br support for new data models. The database languages of these models include
69 A Comparison of Two Learning Algorithms for Text Categorization - Lewis, Ringuette (1994)(Correct)
This paper examines the use of inductive learning to categorize natural language documents into predefined content categories. Categorization of text is of increasing importance in information retriev... / to draw conclusions about the performance of particular methods. In br who have already produced a large database of categorized documents. This
69 Planning to Gather Information - Kwok, Weld (1996)(Correct)
The exponential growth of the Internet has produced a labyrinth of documents,
databases and services. While almost any type of information is
available somewhere, even expert users waste time and effo... / results demonstrating Occam's performance on a variety of information br a labyrinth of documents databases and services. While almost any
68 Supercomputer Performance Evaluation and the Perfect Benchmarks - Cybenko (1990)(Correct)
In the past three years, the Perfect Benchmark
TM
Suite has evolved
from a supercomputer performance evaluation plan, presented by Kuck
and Sameh at the 1987 International Conference on Supercomputi... / Supercomputer Performance Evaluation and the Perfect br of a large publicly accessible database with data arranged in a
68 Index Selection for OLAP - Gupta, Harinarayan, Rajaraman, Ullman (1997)(Correct)
On-line analytical processing (OLAP) is a recent
and important application of database systems. Typically,
OLAP data is presented as a multidimensional
"data cube." OLAP queries are complex and can ta... / complexities and prove strong performance bounds for them. The br and important application of database systems. Typically OLAP data is
67 Visual Navigation of Large Environments Using Textured Clusters - Maciel, Shirley (1995)(Correct)
A visual navigation system is described which uses texture
mapped primitives to represent clusters of objects to maintain
high and approximately constant frame rates. In cases
where there are more uno... / by empirically obtaining performance parameters of the machine and br moves through a static scene database at high and approximately
67 Communicative Actions for Artificial Agents - Cohen, Levesque (1995)(Correct)
This paper considers the semantics of the agent communication
language KQML. By using this language
for communication, agents will be able to request
and provide services. Indeed, numerous projects ha... / achieve goals to commit to the performance of actions for another agent br may range from simple programs and databases to more sophisticated
67 Software Process Model Evolution in the SPADE Environment - Bandinelli, Fuggetta, Ghezzi (1993)(Correct)
Software processes are long-lived entities. Careful design and thorough validation of software process
models are necessary to ensure the quality of the process. They do not prevent, however, process
... / be caused for example by poor performance by new tools acquired by the br languages object-oriented databases reflective languages. I.
67 An Implementation of a Log-Structured File System for UNIX - Seltzer, Bostic, McKusick, Staelin (1993)(Correct)
Research results [ROSE91] demonstrate that a log-structured file system (LFS) offers
the potential for dramatically improved write performance, faster recovery time, and faster
file creation and delet... / for dramatically improved write performance faster recovery time and br is a hybrid between a sequential database log and FFS. It does all writes
67 STiNG: A CC-NUMA Computer System for the Commercial Marketplace - Lovett (1996)(Correct)
STiNG" is a Cache Coherent Non-Uniform Memory Access
(CC-NUMA) Multiprocessor designed and built by Sequent Computer
Systems, Inc. It combines four processor Symmetric Multiprocessor
(SMP) nodes (cal... / and implementation. In addition performance analysis is provided for br are not well-suited to MPPs as databases change in structure over time
66 Competitive Algorithms for Distributed Data Management - Bartal, Fiat, Rabani (1992)(Correct)
We deal with the competitive analysis of algorithms for managing data in a distributed environment. We deal
with the file allocation problem ([DF], [ML]), where copies of a file may be be stored in th... / We consider the competitive performance ST KMRS MMS BLS BBKTW of br may re-arrange the copies of the database. A processor may delete the copy
65 Energy Efficient Indexing On Air - Imielinski, Viswanathan, Badrinath (1994)(Correct)
We consider wireless broadcasting of data as a way of disseminating
information to a massive number of users. Organizing
and accessing information on wireless communication
channels is different from ... / data. Section compares the performance of the two algorithms with the br protocols to file system and database design. In this paper we
65 Cooperative Mobile Robotics: Antecedents and Directions - Cao, Fukunaga, Kahng (1997)(Correct)
There has been increased research interest in systems composed of multiple autonomous mobile robots exhibiting cooperative behavior. Groups of mobile robots are constructed, with an aim to studying ... / a single robot to accomplish or performance benefits can be gained from br environments i.e.computers databases networks The term
65 Generalized Search Trees for Database Systems - Hellerstein, Naughton, Pfeffer (1995)(Correct)
This paper introduces the Generalized Search Tree (GiST), an index structure supporting an extensible set of queries and data types. The GiST allows new data types to be indexed in a manner supporting... / We also present a preliminary performance analysis of RD-trees which br Generalized Search Trees for Database Systems Joseph M. Hellerstein
64 The TV-tree - an index structure for high-dimensional data - Lin, Jagadish, Faloutsos (1994)(Correct)
We propose a file structure to index high-dimensionality data, typically, points in some feature space. The idea is to use only a few of the features, utilizing additional features whenever the additi... / feature spaces. Algorithms and performance measurements. Keywords br a system follows ffl Image databases In we showed how to query
63 Client-Server Paradise - DeWitt, Kabra, Luo, Patel, Yu (1994)(Correct)
This paper describes the design and implementation of Paradise, a database system designed for handling GIS type of applications. The current version of Paradise, uses a client--server architecture an... / version of the system whose performance and functionality is br and implementation of Paradise a database system designed for handling GIS
62 Dissemination-based Data Delivery Using Broadcast Disks - Acharya, Franklin, Zdonik (1995)(Correct)
Mobile computers and wireless networks are emerging technologies which promise to make ubiquitous computing a reality. One challenge that must be met in order to truly realize this potential is that o... / paradigm is its scalability the performance of the system does not depend br Broadcast Disks to provide database access in this environment as
61 Automatically Constructing a Dictionary for Information Extraction.. - Riloff (1993)(Correct)
Knowledge-based natural language processing systems have
achieved good success with certain tasks but they are often
criticized because they depend on a domain-specific
dictionary that requires a grea... / dictionary achieved of the performance of the hand-crafted br selected by keyword search from a database of newswire articles.
61 MedMaker: A Mediation System Based on Declarative Specifications - Papakonstantinou, Garcia-Molina.. (1995)(Correct)
Mediators are used for integration of heterogeneous information sources. In this paper we present a system for declaratively specifying mediators. It is targeted for integration of sources with unstru... / the leftmost indentation. For performance reasons clients query object br This class of sources includes databases that have an often changing
60 Limitations of the Kerberos Authentication System+ - Bellovin (1991)(Correct)
The Kerberos authentication system, a part of MIT's Project Athena, has been
adopted by other organizations. Despite Kerberos's many strengths, it has a number of
limitations and some weaknesses. Some... / Some of our suggestions bear a performance penalty others complicate the br universally trusted -Kerberos database serving an entire company.
60 SunOS 5.0 Multithread Architecture - Powell, Kleiman, Barton, Shah.. (1991)(Correct)
this document are identified by the trademarks of the
companies who market those products.
ii SunSoft
SunOS 5.0 Multithread Architecture iii unknown AWhitePaper
Solaris SunOS 5.0
SunOS 5.0 Multith... / MultithreadedOperations Performance br independent computations. A database system may have many user
59 Spatial Hash-Joins - Lo, Ravishankar (1996)(Correct)
The hash-join paradigm works well for relational
joins, but is hard to apply to spatial
joins. Relational hash-joins can guarantee
that items in different hash buckets are irrelevant
to each other for... / by a wide margin. Further its performance is superior even when the br much attention in the relational database domain because of their superior
59 Knowledge Discovery in Databases: An Attribute-Oriented Approach - Han, Cai, Cercone (1992)(Correct)
Knowledge discovery in databases, or data mining,
is an important issue in the development of data- and
knowledge-base systems. An attribute-oriented induction
method has been developed for knowledge ... / rules to enhance system performance is discussed in Section and br Knowledge Discovery in Databases An Attribute-Oriented Approach
59 The Design Of The Postgres Storage System - Stonebraker (1987)(Correct)
This paper presents the design of the storage system for the POSTGRES data base system
under construction at Berkeley. It is novel in several ways. First, the storage manager supports
transaction mana... / system which suggests that it is performance competitive with WAL systems in br in a System for Distributed Databases SDD- ACM-TODS March .
58 A Sorting Classification of Parallel Rendering - Molnar (1994)(Correct)
We describe three broad classes of parallel rendering methods, based on where the sort from object-space to screen space occurs. These classes encompass most feedforward parallel software and hardware... / and implementers of high-performance parallel rendering systems. br scientific visual- Graphics database traversal R R R R Display
57 Scalable High Speed IP Routing Lookups - Waldvogel, Varghese, Turner, Plattner (1997)(Correct)
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP routing lookup requir... / giving an order of magnitude performance improvement. Using perfect br a process that computes a database mapping destination networks to
57 Balancing Push and Pull for Data Broadcast - Acharya(Correct)
The increasing ability to interconnect computers through internetworking, wireless networks, high-bandwidth satellite, and cable networks has spawned a new class of information-centered applications b... / We analyze the scalability and performance of a broadcast-based system br traditional clientserver database systems and object repositories
57 Object Recognition using Multidimensional Receptive Field Histograms.. - Schiele, Crowley (1996)(Correct)
This chapter presents a technique to determine the identity of objects in
a scene using multidimensional histograms of the responses of a vector of
local linear neighborhood operators (receptive field... / In this experiment we examine the performance of different filter br gives a recognition example on a database of objects. The second part
56 The GMAP: A Versatile Tool for Physical Data Independence - Tsatalos, Solomon, Ioannidis (1994)(Correct)
Physical data independence is touted as a central feature of modern database systems. It allows users
to frame queries in terms of the logical structure of the data, letting a query processor automati... / to achieve significantly better performance than is possible with br as a central feature of modern database systems. It allows users to
56 Querying Documents in Object Databases - Abiteboul, Cluet, Christophides.. (1997)(Correct)
We consider the problem of storing and accessing documents (SGML and HTML, in particular) using database technology. To specify the database image of documents, we use structuring schemas that consi... / quite limited if any From a performance viewpoint it is not yet clear br Querying Documents in Object Databases Serge Abiteboul
55 Near Neighbor Search in Large Metric Spaces - Brin (1995)(Correct)
Given user data, one often wants to find approximate
matches in a large database. A good example of such
a task is finding images similar to a given image in a
large collection of images. We focus on ... / it must be exploited to get good performance in a near neighbor search. br approximate matches in a large database. A good example of such a task
55 Compiler-Based Prefetching for Recursive Data Structures - Luk (1996)(Correct)
Software-controlled data prefetching offers the potential for bridging the ever-increasing speed gap between the memory subsystem and today's high-performance processors. While prefetching has enjoyed... / subsystem and today's high-performance processors. While prefetching br data structures e.g B-trees in database applications octrees in
55 Scalable Parallel Data Mining for Association Rules - Han, Karypis, Kumar (1997)(Correct)
In this paper we propose two new parallel formulations
of the Apriori algorithm that is used for computing
association rules. These new formulations, IDD and HD, address
the shortcomings of two previo... / Section IV presents the performance analysis of the algorithms. br association rules from databases of transactions where each
54 Empirical Support for Winnow and Weighted-Majority Algorithms.. - Blum (1995)(Correct)
This paper describes experimental results on using Winnow and Weighted-Majority based algorithms on a real-world calendar scheduling domain. These two algorithms have been highly studied in the theore... / a theoretical analysis of its performance. In addition we show how br specifically CAP maintains a database of rules sorted by observed
54 Specialization of Perceptual Processes - Horswill (1994)(Correct)
In this report, I discuss the use of vision to support concrete, everyday activity. I
will argue that a variety of interesting tasks can be solved using simple and inexpensive
vision systems. I will p... / that provably improve performance. By demonstrating a sequence br A The frame database B Log of the last burn-in
53 Data Structures and Algorithms for Nearest Neighbor Search in General .. - Yianilos (1993)(Correct)
We consider the computational problem of finding nearest
neighbors in general metric spaces. Of particular interest are
spaces that may not be conveniently embedded or approximated
in Euclidian space,... / In Euclidian cases kd-tree performance is compared. Keywords - br of the space and calling it the database our task is then to locate for
53 An Array-Based Algorithm for Simultaneous Multidimensional Aggregates - Zhao, Deshpande, Naughton (1997)(Correct)
Computing multiple related group-bys and aggregates is one of the core operations of On-Line Analytical
Processing (OLAP) applications. Recently, Gray et al. [GBLP95] proposed the "Cube" operator,
whi... / our algorithm and present performance results for a wide range of br can be used by a multidimensional database system. However we believe it
51 Visibility Culling Using Hierarchical Occlusion Maps - Zhang, Manocha, Hudson, Hoff, III (1997)(Correct)
We present hierarchical occlusion maps (HOM) for
visibility culling on complex models with high depth complexity.
The culling algorithm uses an object space bounding volume hierarchy
and a hierarchy... / are generality interactive performance and significant culling. br algorithms structure the model database into cells or regions and use
51 Answering Queries with Aggregation Using Views - Srivastava, Dar, H.V.Jagadish, Levy (1996)(Correct)
We present novel algorithms for the problem of using materialized views to compute answers to SQL queries with grouping and aggregation, in the presence of multiset tables. In addition to its obvious ... / the potential of improving the performance of SQL query evaluation in br than access to the underlying database. Our contributions are the
51 The R+-Tree: A Dynamic Index For Multi-Dimensional Objects - Sellis, Roussopoulos, Faloutsos (1987)(Correct)
The problem of indexing multidimensional objects is
considered. First, a classification of existing methods is
given along with a discussion of the major issues
involved in multidimensional data index... / results on the searching performance of the R tree br in the past that existing Database Management Systems DBMSs do
51 A Simple Yet Robust Caching Algorithm Based on Dynamic Access Patterns - James Pitkow (1994)(Correct)
The World-Wide Web continues its remarkable and seemingly unregulated growth. This growth has seen a
corresponding increase in network loads and user response times. One common approach for improving
... / item is presented and subsequent performance on recall. A related focus is br analysis of user accesses in a WWW database. In particular the analysis is
50 Mariposa: a wide-area distributed database system - Stonebraker, Aoki, Litwin, Pfeffer.. (1996)(Correct)
The requirements of wide-area distributed database systems differ dramatically from those of local-area network systems. In a wide-area network (WAN) configuration, individual sites usually report t... / interconnect tends to mask performance problems caused by suboptimal br Mariposa a wide-area distributed database system Michael Stonebraker
49 Fine-Grained Sharing in a Page Server OODBMS - Carey, Franklin, Zaharioudakis (1994)(Correct)
For reasons of simplicity and communication efficiency, a number of existing object-oriented database management systems are based on page server architectures; data pages are their minimum unit of tr... / is demanded. We study the performanceof these approaches comparing br of existing object-oriented database management systems are based on
49 Beyond Best Effort: Router Architectures for the Differentiated.. - Kumar, Lakshman, Stiliadis (1998)(Correct)
With the transformation of the Internet to a commercial infrastructure, the ability
to provide differentiated services to users with widely varying requirements is rapidly
becoming as important as mee... / mechanisms the scalability and performance of which have been br may define Voice-over-IP or database queries to be high priority and
48 Active Storage for Large-Scale Data Mining and Multimedia - Riedel, Gibson, Faloutsos (1998)(Correct)
The increasing performance and decreasing cost
of processors and memory are causing system
intelligence to move into peripherals from the
CPU. Storage system designers are using this
trend toward "exc... / Abstract The increasing performance and decreasing cost of br with a focus on the areas of database data mining and multimedia. We
48 Learning to Extract Text-based Information from the World Wide Web - Soderland (1997)(Correct)
There is a wealth of information to be mined from narrative text on the World Wide Web. Unfortunately, standard natural language processing (NLP) extraction techniques expect full, grammatical sentenc... / achieve surprisingly good performance for an NLP system operating br that is equivalent to relational database entries. This is a necessary
48 The Design of Nectar: A Network Backplane for Heterogeneous.. - Arnould (1989)(Correct)
Nectar is a "network backplane" for use in heterogeneous
multicomputers. The initial system consists of a starshaped
fiber-optic network with an aggregate bandwidth
of 1.6 gigabits/second and a switch... / next level of computer system performance. Currently most parallel br Specialized inference engines or database machines might be appropriate
47 Chained Declustering: A New Availability Strategy for Multiprocssor.. - Hsiao (1990)(Correct)
This paper presents a new strategy for increasing the availability of data in multi-processor, shared-nothing
database machines. This technique, termed chained declustering, is demonstrated to provide... / demonstrated to provide superior performance in the event of failures while br Strategy for Multiprocssor Database machines Hui-I Hsiao David J.
47 Cache Digests - Rousskov, Wessels (1998)(Correct)
This paper presents Cache Digest, a novel protocol and optimization technique for cooperative
Web caching. Cache Digest allows proxies to make information about their cache contents
available to peers... / in the Squid proxy cache. The performance of Cache Digest is compared to br well-established in the field of databases for many years and offer small
47 An Orthogonally Persistent Java - Atkinson, Daynès, Jordan, Printezis, .. (1996)(Correct)
The language Java is enjoying a rapid rise in popularity as an application programming language. For many applications an effective provision of database facilities is required. Here we report on a pa... / productivity gains and possible performance gains make orthogonal br an effective provision of database facilities is required. Here we
45 NetCash: A design for practical electronic currency on the Internet - Medvinsky (1993)(Correct)
NetCash is a framework that supports realtime electronic payments
with provision of anonymity over an unsecure network.
It is designed to enable new types of services on the Internet
which have not be... / suffering a noticeable loss of performance. The existence of a central br a transaction This database will grow over time increasing
45 Real-Time Internet Video Using Error Resilient Scalable Compression.. - Tan (1999)(Correct)
We introduce a point to point real-time video transmission scheme over the Internet combining a
low-delay TCP-friendly transport protocol in conjunction with a novel compression method that is
error r... / are used to evaluate the performance of the compression transport br videos stored in remote databases. There are two main requirements
43 A Historical Application Profiler for Use by Parallel Schedulers - Gibbons (1997)(Correct)
A Historical Application Profiler for Use by Parallel Schedulers
Richard Gibbons
Master of Science
Graduate Department of Computer Science
University of Toronto
1997
Scheduling Algorithms that use app... / Profiler lead to improved performance. ii Acknowledgements The br parallel jobs for storage in a job database and the job information that
43 Transactional Memory: Architectural Support for Lock-Free Data.. - Herlihy, Moss (1992)(Correct)
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operatin... / transactions and improves performance by eliminating the need for br of a transaction originated in the database literature viz. Gray
42 Prefetching from a Broadcast Disk - Swarup Acharya (1996)(Correct)
Broadcast Disks have been proposed as a means to efficiently
deliver data to clients in "asymmetric" environments where the
available bandwidth from the server to the clients greatly exceeds
the bandw... / of cost-based caching to improve performance when clients access the br traditional environments such as database and file systems. In particular
41 Building Reliable Distributed Systems with CORBA - Landis, Maffeis (1997)(Correct)
New classes of large-scale distributed applications will
have to deal with unpredictable communication delays,
with partial failures, and with networks that
partition. In addition, sophisticated appli... / system according to price performance criteria. . Limitations of br simulators and object-oriented databases. Object-oriented programming of
41 Size Separation Spatial Join - Koudas, Sevcik (1997)(Correct)
We introduce a new algorithm to compute the spatial join of
two or more spatial data sets, when indexes are not available
on them. Size Separation Spatial Join (S
3
J) imposes a hierarchical
decompo... / observations and demonstrate the performance benefits of S J over br Research and development in Database Management Systems DBMS in
40 New Algorithms for Fast Discovery of Association Rules - Zaki, Parthasarathy, Ogihara, Li (1997)(Correct)
Association rule discovery has emerged as an important problem in knowledge
discovery and data mining. The association mining task consists of identifying
the frequent itemsets, and then forming condi... / step is that of quantity or performance due to its compute intensive br fast discovery. The related database items are grouped together into
39 Validity Checking for Combinations of Theories with Equality - Barrett, Dill, Levitt (1996)(Correct)
An essential component in many verification methods is a fast decision procedure for validating logical expressions. This paper presents the algorithm used in the Stanford Validity Checker (SVC) whi... / the DAG and increase the overall performance significantly. The procedure br called a context which is a database containing a set of logical
39 Distributed Object Management in Thor - Liskov, Day, Shrira (1993)(Correct)
Thor is a new object-oriented database management system (OODBMS), intended to be used in heterogeneous distributed systems to allow programs written in different programming languages to share object... / This architecture provides high performance and also scalability since br Thor is a new object-oriented database management system OODBMS
39 An Evaluation of Non-Equijoin Algorithms - DeWitt, Naughton, Schneider (1991)(Correct)
A non-equijoin of relations R and S is a band join if the join predicate
requires values in the join attribute of R to fall within a specified band
about the values in the join attribute of S. We prop... / for equijoins surpassing the performance of sort-merge and nested-loops br band join on the Gamma database machine and present data from
38 Embra: Fast and Flexible Machine Simulation - Witchel, Rosenblum (1996)(Correct)
This paper describes Embra, a simulator for the processors, caches, and memory systems of uniprocessors and cache-coherent multiprocessors. When running as part of the SimOS simulation environment, Em... / model accuracy with low performance overheads. For example Embra br IRIX running a relational database system and a CAD system for
38 Public International Benchmarks for Parallel Computers - Hockney, Berry (1994)(Correct)
this report: David Bailey (NASA Ames Research Center)
, Michael Berry (University of Tennessee), Jack Dongarra (University of Tennessee/Oak
Ridge National Laboratory), Vladimir Getov (University of So... / problems Chapter- and High Performance Fortran kernels to test the
38 Exploiting Code Mobility in Decentralized and Flexible Network.. - Baldi, Gai, Picco(Correct)
Network management is gaining increasing importance due
to the pervasiveness of computer networks. Nevertheless, mainstream
approaches to network management are presently limited by centralized
mana... / the management station to poor performance or even to the impossibility br information tree MIT database in the ISO approach. The
38 PIOUS: A Scalable Parallel I/O System for Distributed Computing.. - Moyer (1994)(Correct)
PIOUS is a parallel file system architecture that provides cost-effective, scalable bandwidth in a network computing environment. PIOUS employs data declustering, to exploit the combined file I/O and ... / Proceedings of the Scalable High-Performance Computing Conference May br developing parallel scientific database and sorting applications among
38 A Simple Algorithm for Nearest Neighbor Search in High Dimensions - Nene, Nayar (1995)(Correct)
The problem of finding the closest point in high-dimensional spaces is common in pattern recognition. Unfortunately, the complexity of most existing search algorithms, such as k-d tree and R-tree, gro... / structure dramatically improves performance in high dimensions. A br is exactly equal to one of the database points. Space partitioning
38 Knowledge Discovery and Data Mining: Towards a Unifying Framework - Fayyad, Piatetsky-Shapiro, Smyth (1996)(Correct)
This paper presents a first step towards a unifying framework for Knowledge Discovery in Databases. We describe links
between data mining, knowledge discovery, and other related fields. We then define... / data visualization and high performance computing. The unifying goal br for Knowledge Discovery in Databases. We describe links between data
38 An Integrated Runtime and Compile-time Approach for Parallelizing.. - Agrawal, Sussman, Saltz (1993)(Correct)
Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular m... / means of achieving scalable high performance computing. However there are br dynamics geophysical databases and land cover dynamics
37 The ADAPTIVE Communication Environment: An Object-Oriented Network.. - Schmidt (1993)(Correct)
The ADAPTIVE Communication Environment (ACE) implements a set of fundamental design patterns that simplify the development of concurrent event-driven communication software. ACE provides a rich set of... / The demand for robust and high-performance distributed communication br as graphical user interfaces databases operating system kernels
37 Dataflow Query Execution in a Parallel Main-Memory Environment - Wilschut, Apers (1991)(Correct)
In this paper, the performance and characteristics of the
execution of various join-trees on a parallel DBMS are
studied. The results of this study, are a step into the direction
of the design of a qu... / Abstract In this paper the performance and characteristics of the br network. A query on a relational database can be represented as a dataflow
37 Maintenance of Discovered Association Rules in Large Databases: An.. - Cheung, Han, Ng, Wong (1996)(Correct)
An incremental updating technique is developed
for maintenance of the association rules discovered
by database mining. There have been many studies
on efficient discovery of association rules in large... / have been conducted to study the performance of FUP and compare it against br Association Rules in Large Databases An Incremental Updating
36 Integrating Classification and Association Rule Mining - Liu (1998)(Correct)
Classification rule mining aims to discover a small set of rules in the database that forms an accurate classifier. Association rule mining finds all the rules existing in the database that satisfy so... / efficiently and without loss of performance i.e.the accuracy of the br a small set of rules in the database that forms an accurate
36 Cost-based Query Scrambling for Initial Delays - Urhan, Franklin, Amsaleg (1998)(Correct)
Remote data access from disparate sources across a wide-area network
such as the Internet is problematic due to the unpredictable
nature of the communications medium and the lack of knowledge
about th... / which although providing good performance in many cases were also shown br relational and object relational database systems currently plays little
36 Matchmaking: Distributed Resource Management for High Throughput.. - Raman, Livny, Solomon (1998)(Correct)
Conventional resource management systems use a system
model to describe resources and a centralized scheduler
to control their allocation. We argue that this paradigm
does not adapt well to distribute... / tasks so as to optimize a stated performance metric. This paradigm is br defined schema of the resources database. The task of mapping
35 Face Recognition: A Convolutional Neural Network Approach - Lawrence, Giles, Tsoi, Back (1997)(Correct)
Faces represent complex, multidimensional, meaningful visual stimuli and developing a computational model for face recognition is difficult [43]. We present a hybrid neural network solution which comp... / exhibits better classification performance than the eigenfaces approach br eigenfaces approach on the database considered as the number of
34 Policy Driven Management For Distributed Systems - Sloman (1994)(Correct)
Separating management policy from the automated managers which interpret the policy
facilitates the dynamic change of behaviour of a distributed management system. This
permits it to adapt to evolutio... / Manipulation User Interface Performance Management COMMON br Trading Directory File Database Distributed Processing
34 The DEDALE System for Complex Spatial Queries - Grumbach, Rigaux, Segoufin (1998)(Correct)
This paper presents dedale, a spatial database system intended to overcome some limitations
of current systems by providing an abstract and non-specialized data model and query
language for the repres... / and specific issues. Apart from performance considerations due to the large br paper presents dedale a spatial database system intended to overcome some
34 Mixed Integer Programming Methods for Computing Nonmonotonic.. - Bell (1994)(Correct)
Though the declarative semantics of both explicit and nonmonotonic negation in logic
programs has been studied extensively, relatively little work has been done on computation
and implementation of th... / experiments to study the performance of all three. The experimental br Computing Nonmonotonic Deductive Databases Colin Bell y Anil
34 Mobile Agents: Are they a good idea? - Harrison, Chess, Kershenbaum (1995)(Correct)
Mobile agents are programs, typically written in a script language, which may be dispatched from a client computer and transported to a remote server computer for execution. Several authors have sug... / interpreted language. There is a performance penalty for this but since br mail another may deliver a database retrieval request to a server
34 Knowledge Discovery in Large Spatial Databases: Focusing Techniques.. - Ester, Kriegel, Xu (1995)(Correct)
Both, the number and the size of spatial databases are rapidly growing
because of the large amount of data obtained from satellite images, X-ray crystallography
or other scientific equipment. Theref... / protein-protein docking. A performance evaluation on this database br Discovery in Large Spatial Databases Focusing Techniques for
34 Storage Estimation for Multidimensional Aggregates in the Presence of .. - Amit Shukla (1996)(Correct)
To speed up multidimensional data analysis,
database systems frequently precompute aggregates
on some subsets of dimensions and
their corresponding hierarchies. This improves
query response time. Howe... / amounts of data. To meet the performance demands imposed by these br multidimensional data analysis database systems frequently precompute
34 PASSION: Parallel And Scalable Software for Input-Output - Choudhary, Bordawekar, Harry.. (1994)(Correct)
We are developing a software system called PASSION: Parallel And Scalable Software for InputOutput
which provides software support for high performance parallel I/O. PASSION provides support
at the la... / software support for high performance parallel I O. PASSION provides br scale scientific computations database and information processing
33 GSAT and Dynamic Backtracking - Ginsberg, McAllester (1994)(Correct)
There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as GSAT; the other contains systematic approaches that use a poly... / problems of this type its performance is reported Selman and br for the size of the justification database and conditions are presented
33 Data Flow Analysis for Verifying Properties of Concurrent Programs - Dwyer (1994)(Correct)
In this paper we present an approach, based on data
flow analysis, that can provide cost-effective analysis of
concurrent programs with respect to explicitly stated
correctness properties. Using this ... / graph as a flow graph performance suffered from the impractical br has moved from special purpose database and operating systems into the
33 Moving Objects Databases: Issues and Solutions - Wolfson, Xu, Chamberlain, Jiang (1998)(Correct)
Consider a database that represents information about
moving objects and their location. For example, for a
database representing the location of taxi-cabs a typical
query may be: retrieve the free ca... / which would impose a serious performance overhead or the answer to br Moving Objects Databases Issues and Solutions Ouri
32 Concurrency and Communication in Transaction Logic - Bonner, Kifer (1996)(Correct)
In previous work, we developed Transaction Logic (or T R), which deals with state changes in deductive databases. T R provides a logical framework in which elementary database updates and queries can ... / increases the flexibility performance and power of the language. br with state changes in deductive databases. T R provides a logical
32 Optimal Prefetching via Data Compression - Vitter, Krishnan (1995)(Correct)
Caching and prefetching are important mechanisms for speeding up access time to data on secondary
storage. Recent work in competitive online algorithms has uncovered several promising
new algorithms f... / method of improving response time performance by anticipating future user br applications to large-scale databases and hypertext systems. Our
32 Spatial Joins Using R-trees: Breadth-First Traversal with Global.. - Yun-Wu Huang (1997)(Correct)
R-tree based spatial join is useful because
of both its superior performance and the
wide spread implementation of R-trees. We
present a new R-tree join method called BFRJ
(Breadth-First R-tree Join).... / because of both its superior performance and the wide spread br and CAD CAM. A successful spatial database management system must provide
32 The Secure Remote Password Protocol - Wu (1997)(Correct)
This paper presents a new password authentication and key-exchange protocol suitable for authenticating users and exchanging keys over an untrusted network. The new protocol resists dictionary attacks... / and offers significantly improved performance over comparably strong br who captures the password database cannot use it directly to
32 STING : A Statistical Information Grid Approach to Spatial Data Mining - Wang (1997)(Correct)
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of spatial data and to th... / data semantics and achieve high performance. Spatial data mining has wide br may implicitly exist in spatial databases is a challenging task due to
32 Reasoning With Characteristic Models - Henry Kautz (1993)(Correct)
Formal AI systems traditionally represent knowledge using logical formulas.
We will show, however, that for certain kinds of information, a modelbased
representation is more compact and enables faster... / linear time thus matching the performance using Horn theories. More br the formulas. Indeed standard databases are naturally viewed as
32 Mobile Agents White Paper - White (1996)(Correct)
this paper.
Introduction
New products
New applications
New networks
About "Mobile Agents"
Enabling mobile agents
Mobile agent paradigm
Mobile agent concepts
Mobile agent technology
Programming mobile ... / or acknowledges a procedure's performance. A request includes data that br an individual buyer or seller. A database component in a public server
31 WATCHMAN: A Data Warehouse Intelligent Cache Manager - Scheuermann, Shim, Vingralek (1996)(Correct)
Data warehouses store large volumes of data which are used frequently by decision support applications. Such applications involve complex queries. Query performance in such an environment is critical ... / involve complex queries. Query performance in such an environment is br heterogeneous operational databases IK Wid Data warehouses
31 A Multimedia Enhanced Transport Service in a Quality of Service.. - Campbell, Coulson, Hutchison(Correct)
For applications relying on the transfer of multimedia, and in particular continuous media,
it is essential that quality of service (QoS) is guaranteed
system-wide,including#
end-systems,
communicat... / and implement the required performance properties of multimedia br and remote multimedia database access. In these applications
31 TREC and TIPSTER Experiments With INQUERY - James Callan (1995)(Correct)
INQUERY is a probablistic information retrieval system based upon a Bayesian
inference network model. This paper describes recent improvements to the system as
a result of participation in the TIPSTER... / have shown that good levels of performance can be achieved. John br analysis of the documents in the database. In general it is more effective
31 A Three Dimensional Image Cache for Virtual Reality - Schaufler, Stürzlinger (1996)(Correct)
Despite recent advances in rendering hardware, large and complex virtual environments cannot be displayed
with a sufficiently high frame rate, because of limitations in the available rendering perform... / in the available rendering performance. This paper presents a new br must be stored in the scene database so that images from any point of
31 On Comparing Classifiers: Pitfalls to Avoid and a Recommended Approach - Salzberg (1997)(Correct)
An important component of many data mining projects is finding a good classification algorithm,
a process that requires very careful thought about experimental design. If not done very carefully, co... / and how the changes will improve performance. Although these studies may br techniques to analyze very large databases which inevitably contain some
30 Recognition of Human Body Motion Using Phase Space Constraints - Campbell, Bobick (1995)(Correct)
A new method for representing and recognizing human
bodymovements is presented. Assuming the availability
of Cartesian tracking data, we develop techniques
for representation of movements basedon spac... / of the problem to establish performance criteria and to be certain br are acquiring ever larger video databases. If these can be
30 Requirements for Network Payment: The NetCheque Perspective - Neuman, Medvinsky (1995)(Correct)
Secure methods of payment are needed before we will
see widespread commercial use of the Internet. Recently
proposed and implemented payment methods follow
one of three models: electronic currency, cr... / suffering a noticeable loss of performance. The existence of central br Wide Web home pages and product databases. In most cases the actual
30 OLAP and Statistical Databases: Similarities and Differences - Shoshani (1997)(Correct)
During the 1980's there was a lot of activity in the area of
Statistical Databases, focusing mostly on socio-economic
type applications, such as census data, national production
and consumption patter... / in OLAP concentrated on access performance. We start in section with br OLAP and Statistical Databases Similarities and Differences
30 Maintenance of Data Cubes and Summary Tables in a Warehouse - Mumick, Quass, Mumick (1997)(Correct)
Data warehouses contain large amounts of information, often
collected from a variety of independent sources. Decisionsupport
functions in a warehouse, such as on-line analytical
processing (OLAP), inv... / to help them increase the system performance. As changes most notably new br to be materialized either by the database administrator or by using an
30 JAM: Java Agents for Meta-Learning over Distributed Databases - Stolfo, Prodromidis, Tselepis, Lee.. (1997)(Correct)
In this paper, we describe the JAM system, a distributed,
scalable and portable agent-based data
mining system that employs a general approach
to scaling data mining applications that we call
meta-le... / Other publications have reported performance results on standard test br for Meta-Learning over Distributed Databases Salvatore Stolfo Andreas
29 Random Sampling from Databases - Olken (1993)(Correct)
Random Sampling from Databases
by
Frank Olken
Doctor of Philosophy in Computer Science
University of California at Berkeley
Professor Michael Stonebraker, Chair
In this thesis I describe efficient me... / and characterize their performance. I describe and analyze br Random Sampling from Databases by Frank Olken B.S.
29 Query Processing in Tertiary Memory Databases - Sarawagi (1996)(Correct)
Query Processing in Tertiary Memory Databases
by
Sunita Sarawagi
Doctor of Philosophy in Computer Science
University of California at Berkeley
Professor Michael R. Stonebraker, Chair
This thesis prese... / v Performance Evaluation . br Processing in Tertiary Memory Databases by Sunita Sarawagi Bachelor
29 On Packing R-trees - Kamel, Faloutsos (1993)(Correct)
We propose new R-tree packing techniques for static databases. Given a collection of rectangles,
we sort them and we build the R-tree bottom-up. There are several ways to sort the
rectangles; the inno... / as other R-tree variants. The performance gain of the our method seems to br packing techniques for static databases. Given a collection of
29 Person identification using multiple cues - Brunelli, Falavigna (1995)(Correct)
This paper presents a person identification system based on acoustic and visual features. The system is organized as a set of nonhomogeneous classifiers whose outputs are integrated after a normalizat... / for an integration module whose performance is evaluated. A novel technique br number of people in the reference database and finally the time interval
29 Experiments on Multistrategy Learning by Meta-Learning - Chan (1993)(Correct)
In this paper, we propose meta-learning as a general technique
to combine the results of multiple learning algorithms,
each applied to a set of training data. We detail several metalearning
strategies... / characteristics and the performance of different algorithms on br however it also creates databases of increasing size and
29 Safe and Efficient Sharing of Persistent Objects in Thor - Liskov, Adya, Castro, Day, Ghemawat, .. (1996)(Correct)
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 sa... / to avoid paying the associated performance costs. This paper gives an br Thor is an object-oriented database system designed for use in a
29 Question Answering from Frequently-Asked Question Files: Experiences.. - Robin Burke (1997)(Correct)
This technical report describes FAQ Finder, a natural language question-answering
system that uses files of frequently-asked questions as its knowledge base. Unlike AI
question-answering systems that ... / an evaluation of the system's performance against a corpus of user br natural kind of interface to a database of answers is the question
29 Using Multiple Knowledge Sources for Word Sense Discrimination - McRoy (1992)(Correct)
This paper addresses the problem of how to identify the intended meaning of individual
words in unrestricted texts, without necessarily having access to complete representations
of sentences. To discr... / tagging of the text improves the performance of information retrieval br including information retrieval database generation from text and machine
29 Reduced Overhead Logging for Rollback Recovery in Distributed Shared.. - Suri (1995)(Correct)
Rollback techniques that use message logging and deterministic replay can be used in parallel systems to recover a failed node without involving other nodes. Distributed shared memory (DSM) systems ca... / Center for Reliable and High-Performance Computing Mountain Avenue br which are logged by commonly used database logging methods. A log-based
29 Replication Using Group Communication Over a Partitioned Network - Amir (1995)(Correct)
In systems based on the client-server model, a single server may serve many clients and
the heavy load on the server may cause the response time to be adversely affected. In such
circumstances, replic... / . PERFORMANCE br maintains a private copy of the database. Actions queries and updates
29 Typechecking and Modules for Multi-Methods - Chambers, Leavens (1995)(Correct)
Two major obstacles hindering the wider acceptance of multi-methods are concerns over the lack of
encapsulation and modularity and the absence of static typechecking in existing multi-method-based
lan... / Chambers Leavens performance difference between singly- and br typechecking Polyglot a CLOSlike database type system Agrawal et al.