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.
321 The Lorel Query Language for Semistructured Data - Abiteboul, Quass, McHugh, Widom.. (1997)(Correct)
We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simp... / describes the Lore system and query processor. We also briefly discuss a br language of the Lore prototype database management system at Stanford.
179 CLASSIC: A Structural Data Model for Objects - Borgida, Brachman, McGuinness.. (1989)(Correct)
classic is a data model that encourages the description of objects not only in terms of their relations to other known objects, but in terms of a level of intensional structure as well. The classic la... / DBMS languages but for which query processing is still tractable. This br hitherto explored by deductive databases. Motivation A database
158 Multidimensional Access Methods - Gaede, Günther (1997)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to post on
servers, to redistribute to lists, or to use any component of this work in other works, requires prior
specific permission and... / Management Systems-Query Processing H. . Information Storage br Germany Search operations in databases require some special support at
144 Efficiently Updating Materialized Views - Blakeley, Larson, Tompa (1986)(Correct)
Query processing can be sped up by keeping frequently
accessed users' views materialized. However,
the need to access base relations in response to
queries can be avoided only if the materialized view... / Ontario N L G Abstract Query processing can be sped up by keeping br We propose a method in which all database updates to base relations are
128 Research Problems in Data Warehousing - Widom (1995)(Correct)
The topic of data warehousing encompasses architectures,
algorithms, and tools for bringing together selected
data from multiple databases or other information
sources into a single repository, called... / inefficiency and delay in query processing especially when queries are br selected data from multiple databases or other information sources
126 Data Model and Query Evaluation in Global Information Systems - Levy, SRIVASTAVA, KIRK (1991)(Correct)
Global information systems involve a large number of information sources distributed
over computer networks. The variety of information sources and disparity of interfaces makes the
task of easily l... / sources distributed query processing dynamic query plans site br of multidatabase and distributed database systems. Our architecture is
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... / system architecture query processing strategy and storage system br the preliminary design of a new database management system called
121 Telos: Representing Knowledge About Information Systems - Mylopoulos, Borgida, Jarke.. (1990)(Correct)
This paper describes a language that is intended to support software engineers in the development
of information systems throughout the software lifecycle. This language is not a programming
language.... / deductive databases for query processing and integrity enforcement. In br adapts concepts from deductive databases for query processing and
119 Query Caching and Optimization in Distributed Mediator Systems - Adali, Candan, al. (1996)(Correct)
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... / vs cs.umd.edu Abstract Query processing and optimization in mediator br accesses and integrates multiple databases and or software packages. In
118 Optimizing Queries with Materialized Views - Chaudhuri, Krishnamurthy.. (1995)(Correct)
While much work has addressed the problem of
maintaining materialized views, the important question
of optimizing queries in the presence of materialized
views has not been resolved. In this paper, we... / for the benefit of improved query processing has been proposed in the br the statistical properties of the database. Since queries are often
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... / and as a means of guiding the query processor and optimizing query br Optimization in Semistructured Databases Roy Goldman Stanford
110 Optimizing Queries across Diverse Data Sources - Haas, Kossmann, Wimmers, Yang (1997)(Correct)
Businesses today need to interrelate data stored in diverse systems
with differing capabilities, ideally via a single high-level query
interface. We present the design of a query optimizer for Garlic
... / have limited or specialized query processing capabilities. Queries in br Some data are in traditional database systems with a powerful query
109 Query Reformulation for Dynamic Information Integration - Yigal Arens (1996)(Correct)
The standard approach to integrating heterogeneous information sources is to build
a global schema that relates all of the information in the different sources, and to pose queries
directly against ... / are four basic components to query-processing in SIMS These are br reformulation heterogeneous databases. . Introduction The
102 Lore: A Database Management System for Semistructured Data - McHugh, Abiteboul, Goldman, Quass.. (1997)(Correct)
Lore (for Lightweight Object Repository) is a DBMS designed specifically for managing semistructured information. Implementing Lore has required rethinking all aspects of a DBMS, including storage man... / storage management indexing query processing and optimization and user br queries and commands and process query results. Any session with a
99 A Declarative Language for Querying and Restructuring the Web - Lakshmanan, Sadri, Subramanian (1996)(Correct)
World Wide Web is a hypertext based, distributed
information system that provides access to vast
amounts of information in the internet. A fundamental
problem with the Web is the difficulty of retriev... / of a resource in the Web. query processor should also make use of this br language processing and databases. The Problem How can a user
96 W3QS: A Query System for the World-Wide Web - Konopnicki (1995)(Correct)
The World-Wide Web (WWW) is an ever
growing, distributed, non-administered, global
information resource. It resides on the worldwide
computer network and allows access
to heterogeneous information: te... / effective and flexible query processing which addresses the br Condition Library Query Processor Query Input Algorithm Library
94 Scaling Heterogeneous Databases and the Design of DISCO - Tomasic, Raschid, Valduriez (1996)(Correct)
Access to large numbers of data sources introduces new problems for users of heterogeneous
distributed databases. End users and application programmers must deal
with unavailable data sources. Databas... / addresses these problems. Query processing semantics are developed to br Scaling Heterogeneous Databases and the Design of Disco
93 The EXODUS Extensible DBMS Project: An Overview - Michael Carey David (1990)(Correct)
This paper presents an overview of EXODUS, an extensible database system project that is
addressing data management problems posed by a variety of challenging new applications. The
goal of the proje... / for limited recursive query processing. Unlike POSTGRES PROBE br Storage Manager Backend Process Query Tree Figure The
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... / L. Vieille. Recursive query processing The power of logic. br L. Vieille. A database-complete proof procedure based
87 Real-Time Databases - Ramamritham (1993)(Correct)
Data in real-time databases has to be logically consistent as well as temporally
consistent. The latter arises from the need to preserve the temporal validity of data
items that reflect the state of t... / The goal of transaction and query processing approaches adopted in br Real-Time Databases Krithi Ramamritham
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... / during query optimization and query processing. Because these translations br connects to a variety of databases using wrappers such as for
85 Mobile Wireless Computing: Challenges in Data Management - Imielinski, Badrinath (1994)(Correct)
Mobile computing is a new emerging computing paradigm posing many challenging data management
problems. We identify these new challenges and investigate their technical significance. New research
prob... / affect data distribution query processing and transaction processing br as well as services. Query Processing Querying wireless broadcasted
83 Updating Derived Relations: Detecting Irrelevant and Autonomously.. - Blakeley, Larson (1989)(Correct)
Consider a database containing not only base relations but also stored derived relations
(also called materialized or concrete views). When a base relation is updated, it may also be
necessary to upda... / Management Systems-query processing General Terms Theory br y Abstract Consider a database containing not only base
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 ... / a parallel database query processing program can adapt the br as scientific simulations and database management systems will require
81 The Volcano Optimizer Generator: Extensibility and Efficient Search - Graefe, McKenna (1993)(Correct)
Emerging database application domains demand not only newfunctionality but also high
performance. Tosatisfy these tworequirements, the Volcano project provides efficient,
extensible tools for query an... / the Volcano extensible parallel query processor GCD the REVELATION br p. . Abstract Emerging database application domains demand not
80 Data Mining: An Overview from a Database Perspective - Chen, Han, Yu (1996)(Correct)
Mining information and knowledge from large databases has been recognized by many researchers as a key research topic in database systems and machine learning, and by many industrial companies as an i... / to information management query processing decision making process br Data Mining An Overview from Database Perspective Ming-Syan Chen
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... / remain usable in speeding up query processing. The maintenance of derived br and Gio Wiederhold Abstract-Database updates are small and incremental
79 Working with Persistent Objects: To Swizzle or Not to Swizzle - Moss (1992)(Correct)
Pointer swizzling 3 is the conversion of database objects between an external form (object identifiers) and an internal form (direct memory pointers). Swizzling is used in some object-oriented datab... / minimal disk seeking or query processing so I O and CPU costs are br is the conversion of database objects between an external form
78 Querying Semistructured Heterogeneous Information - Quass, Rajaraman, Sagiv, Ullman.. (1995)(Correct)
Semistructured data has no absolute schema fixed in advance and its structure may be irregular
or incomplete. Such data commonly arises in sources that do not impose a rigid structure
(such as the Wor... / the basic architecture and query processing strategy of the lightweight br languages semistructured data database integration object repositories
77 A Framework for Supporting Data Integration Using the Materialized.. - Hull, Zhou (1996)(Correct)
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.... / technologies including query processing against virtual integrated br updates from the source databases. Squirrel mediators provide two
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 ... / up data transmission and query processing. The situation is more br caching scheme for client-server database architectures Arthur M. Keller
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... / document database. Efficient query processing techniques are proposed for br the entire append-only document database. Efficient query processing
75 Regular Path Queries with Constraints - Abiteboul, Vianu (1998)(Correct)
The evaluation of path expression queries on semistructured data in a distributed asynchronous environment is considered. The focus is on the use of local information expressed in the form of path con... / of such information in query processing turns out to be nontrivial. br to be useful in a variety of database contexts ranging from hypertext
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 ... / prior to the start of query processing e.g. get within of the br Aggregation in traditional database systems is performed in batch
73 Data Mining: An Overview from Database Perspective - Chen, Han, Yu (1997)(Correct)
Mining information and knowledge from large databases has been recognized by many researchers as a key research topic in database systems and machine learning, and by many industrial companies as an i... / to information management query processing decision making process br Data Mining An Overview from Database Perspective Ming-Syan Chen
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... / a data-shipping architecture query processing is performed largely at the br false and S is empty. Processing query Q i involves the
71 Every Logic Program Has a Natural Stratification And an Iterated.. - Przymusinski (1989)(Correct)
1 Introduction
The perfect model semantics [ABW88, VG89b, Prz88a, Prz89b] provides an
attractive alternative to the traditionally used semantics of logic programs
based on Clark's completion of the p... / extended the Magic Sets query processing method and showed its br Prz b and is used in existing database Zan and truth maintenance
70 Query Folding - Qian (1996)(Correct)
Query folding refers to the activity of determining if and how a query can be answered using
a given set of resources, which might be materialized views, cached results of previous queries,
or queries... / in centralized databases to query processing in distributed databases br or queries answerable by another database. We investigate query folding in
68 A Query Language for XML - Deutsch, Fernandez, Florescu, Levy.. (1998)(Correct)
An important application of XML is the interchange of electronic data (EDI) between multiple data sources on the Web. As XML data proliferates on the Web, applications will need to integrate and aggre... / query-language design query processing and optimization schema br are all well-understood database problems and their solutions
67 Queries and Query Processing in Object-Oriented Database Systems - Straube (1990)(Correct)
Object-oriented database systems have been proposed as an effective solution for
providing the data management facilities of complex applications. Proving this claim
and the investigation of related i... / of Alberta Queries and Query Processing in Object-Oriented Database br programming languages query processing and query languages. The following
66 The Architecture of the EXODUS Extensible DBMS - Carey (1986)(Correct)
With non-traditional application areas such as engineering design, image/voice data management, scientific/statistical applications, and artificial intelligence systems all clamoring for ways to store... / a capability for intelligent query processing. Unlike POSTGRES PROBE will br data it is clear that traditional database technology has been pushed to its
63 The Information Manifold - Kirk, Levy, Sagiv, Srivastava(Correct)
We describe the Information Manifold (IM), a
system for browsing and querying
of multiple networked information sources. As
a first contribution, the system demonstrates the
viability of knowledge rep... / we describe novel query processing algorithms used to combine br have a vast number of internal databases which they are making
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... / styles of accessing data. Query processing in the context of documents br after the translation process. Querying Documents in Object
56 Temporal Query Languages: a Survey - Chomicki (1995)(Correct)
We define formal notions of temporal domain and temporal database, and use them
to survey a wide spectrum of temporal query languages. We distinguish between an
abstract temporal database and its conc... / semantics expressiveness query processing and its computational br Category Survey Area Temporal Databases Abstract We define formal
56 Managing Semantic Heterogeneity in Databases: A Theoretical.. - Hull (1997)(Correct)
In Proc. of Intl. Conf. on Very Large Data Bases, pages 455--468, 1990. [HZ96] R. Hull and G. Zhou. A framework for supporting data integration using the materialized and virtual approaches. In Pro... / B.E. Prasad and P.G. Reddy. Query processing in heterogeneous distributed br reconstruction of relational database theory. In M. L. Brodie J.
56 Database System Issues in Nomadic Computing - Alonso, Korth (1993)(Correct)
Mobile computers and wireless networks are emerging technologies that will soon be available to a
wide variety of computer users. Unlike earlier generations of laptop computers, the new generation
o... / cost assumptions underlying query processing. In these systems power br Database System Issues in Nomadic
55 Modeling Web Sources for Information Integration - Knoblock, Minton, Ambite, Ashish.. (1998)(Correct)
The Web is based on a browsing paradigm that makes it difficult to retrieve and integrate data from multiple sites. Today, the only way to do this is to build specialized applications, which are time-... / that are used in modeling and query processing and how the uniform br developer himself can issue database-like queries as if the
54 Temporal and Real-Time Databases: A Survey - Ozsoyoglu, Snodgrass (1995)(Correct)
A temporal database contains time-varying data. In a real-time database transactions
have deadlines or timing constraints. In this paper we review the substantial research in
these two heretofore sepa... / and temporal support with query processing and transaction processing br Temporal and Real-Time Databases A Survey Gultekin
54 Structure Identification in Relational Data - Dechter, Pearl (1997)(Correct)
This paper presents several investigations into the prospects for
identifying meaningful structures in empirical data, namely, structures
permitting effective organization of the data to meet requir... / that facilitate efficient query processing routines. We view this br or a hypergraph as in relational databases and the task is to find
53 Object Fusion in Mediator Systems - Papakonstantinou, Abiteboul.. (1996)(Correct)
One of the main tasks of mediators is to fuse information from heterogeneous information
sources. This may involve, for example, removing redundancies, and resolving inconsistencies in
favor of the mo... / places a new burden on the query processing unit the Mediator br stored not only in conventional databases but also in file systems the
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... / each query. The goal of the query processing system is to solve the query 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... / servers to clients so that query processing as well as application br of existing object-oriented database management systems are based on
49 Access Support in Object Bases - Kemper, Moerkotte (1989)(Correct)
In this work access support relations are introduced as a means for optimizing
query processing in object-oriented database systems. The general idea is
to maintain separate structures (disassociated ... / as a means for optimizing query processing in object-oriented database br processing in object-oriented database systems. The general idea is to
45 Modeling and Querying Moving Objects - Prasad Sistla (1997)(Correct)
In this paper we propose a data model for representing
moving objects in database systems. It is called the Moving
Objects Spatio-Temporal (MOST) data model. We also
propose Future Temporal Logic (FTL... / need to be added to existing query processing systems to deal with dynamic br representing moving objects in database systems. It is called the Moving
44 A Database Perspective on Knowledge Discovery - Imielinski, Mannila (1996)(Correct)
this article
we have claimed that specification, compilation and
execution of query languages for database mining is a
challenge that requires a similar, long-term effort
extending to the next decade ... / basic operations and query processing strategies. The most br Imielinski And Heikki Mannila Database Mining Is Not Simply Another
43 Quilt: An XML Query Language for Heterogeneous Data Sources - Chamberlin, Robie, Florescu (2000)(Correct)
The World Wide Web promises to transform human society by making
virtually all types of information instantly available everywhere. Two prerequisites
for this promise to be realized are a universa... / which is ignored during query processing. As in SQL the beginning br documents relational databases and object repositories.
42 Similarity-Based Queries for Time Series Data - Davood Rafiei (1997)(Correct)
We study a set of linear transformations on the Fourier
series representation of a sequence that can be used as
the basis for similarity queries on time-series data. We
show that our set of transforma... / time warping. We present a query processing algorithm that uses the br of growing importance in many new database applications such as data mining
42 Mobile Wireless Computing: Solutions and Challenges in Data Management - Imielinski, Badrinath (1993)(Correct)
Mobile computing is a new emerging computing paradigm posing many challenging data
management problems. We identify these new challenges and investigate their technical significance.
New research prob... / processing distributed query processing and distributed recovery we br for mobile transaction processing and query processing as well as
42 Towards A Deductive Object-Oriented Database Language - Abiteboul (1990)(Correct)
A language for databases with sets, tuples, lists, object identity and structural inheritance is proposed. The core language is logic-based with a fixpoint semantics. Methods with overloading and meth... / advances such as fast query processing or reliable concurrency br A Deductive Object-Oriented Database Language Serge Abiteboul
41 NoDoSE - A tool for Semi-Automatically Extracting Structured and.. - Brad Adelberg (1998)(Correct)
Often interesting structured or semistructured data is not in database systems but in HTML
pages, text files, or on paper. The data in these formats is not usable by standard query processing
engines ... / is not usable by standard query processing engines and hence users need br or semistructured data is not in database systems but in HTML pages text
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... / or statically exploit bitmap query processing techniques. Finally we br Research and development in Database Management Systems DBMS in
40 Query Processing in the SIMS Information Mediator - Arens, Hsu, Knoblock (1996)(Correct)
A critical problem in building an information
mediator is how to translate a domain-level
query into an efficient query plan for accessing
the required data. We have built a flexible
and efficient inf... / Query Processing in the SIMS Information br Execution Learning Domain Model Database Models Output User's Query
40 Querying in highly mobile distributed environments - Imielinski, Badrinath (1992)(Correct)
New challenges to the database field brought
about by the rapidly growing area of wireless personal
communication are presented. Preliminary
solutions to two of the major problems, control of
update v... / volume and integration of query processing and data acquisition are br Abstract New challenges to the database field brought about by the
39 Temporal Deductive Databases - Baudinet, Chomicki, Wolper (1992)(Correct)
We survey a number of approaches to the problem of finite representation of infinite temporal extensions.
Two of them, Datalog 1S and Templog, are syntactical extensions of Datalog ; the third is base... / October Keywords query processing logic programming temporal br Temporal Deductive Databases Marianne Baudinet
39 Semantics of Logic Programs: Their Intuitions and Formal Properties.. - Dix (1994)(Correct)
Properties. In Luis Moniz Pereira and Anil Nerode, editors, Logic Programming and Non-Monotonic Reasoning, Proceedings of the Second International Workshop, pages 43--59. Lisbon, MIT Press, July 1993.... / Laurent Vieille. Recursive Query Processing The Power of Logic. br Symposium on Principles of Database Systems pages - . ACM
38 Distributed Object Management - Manola (1992)(Correct)
Future information processing environments will consist of a vast network of heterogeneous, autonomous, and distributed computing resources, including computers (from mainframe to personal), informati... / capabilities. Distributed query processing is a very simple example of br applications and data files and databases A key challenge in this
38 Data Management for Mobile Computing - Imielinski, Badrinath (1993)(Correct)
Mobile Computing is a new emerging computing
paradigm of the future. Data Management in
this paradigm poses many challenging problems
to the database community. In this paper we identify
these new cha... / to affect data distribution query processing and transaction processing br many challenging problems to the database community. In this paper we
38 Advanced Video Information System: Data Structures and Query.. - Adali, Candan, Chen, Erol.. (1996)(Correct)
In this paper, we describe how video data may be organized and structured so as to
facilitate queries. We develop a formal model of video data and show how spatial data
structures, suitably modified, ... / System Data Structures and Query Processing Sibel Adali Kasim S. br algorithms to update these video databases. A prototype system called AVIS
37 A Methodology For Query Reformulation In Cis Using Semantic Knowledge - Florescu, Raschid (1996)(Correct)
We consider Cooperative Information Systems (CIS) that are multidatabase systems
(MDBMS), with a common object-oriented model, based on the ODMG standard, together
with local databases that may be rel... / our methodology for CIS-MDBMS query processing proceeds along the following br standard together with local databases that may be relational
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... / choice DeG Also various query processing strategies have been br network. A query on a relational database can be represented as a dataflow
37 Planning and Reformulating Queries for Semantically-Modeled.. - Arens (1992)(Correct)
With vast amounts of information available from various
sources, integrating data from multiple databases
is an important problem. The SIMS project attacks
this problem using a variety of Artificial I... / support on-line deductive query processing. This model-driven br integrating data from multiple databases is an important problem. The
37 Obtaining Complete Answers from Incomplete Databases - Levy (1996)(Correct)
We consider the problem of answering queries
from databases that may be incomplete. A
database is incomplete if some tuples may be
missing from some relations, and only a part
of each relation is know... / to significant speedups in query processing. Finally the br Complete Answers from Incomplete Databases Alon Y. Levy AT T Research
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... / sites. Traditional static query processing approaches break down in this br relational and object relational database systems currently plays little
35 A Wrapper Architecture for Legacy Data Sources - Roth, Schwarz (1997)(Correct)
Garlic is a middleware system that provides an integrated view of a
variety of legacy data sources, without changing how or where data is stored. In
this paper, we describe our architecture for wrap... / and non-traditional query processing capabilities. br no support for queries to complex database management systems with
35 Efficient Assembly of Complex Objects - Keller, Graefe, Maier (1991)(Correct)
Although object-oriented database systems offer advantages over relational or record-oriented database systems, such as modeling facilities for complex objects, they are criticized for poor performanc... / assembly used in the Volcano query processing system and the Revelation br for singleprocess and for multi-process query evaluation
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... / a description of a design of a query processing system based on our mixed br Computing Nonmonotonic Deductive Databases Colin Bell y Anil
34 SchemaSQL - A Language for Interoperability in Relational.. - Lakshmanan, Sadri, Subramanian (1996)(Correct)
We provide a principled extension of SQL, called SchemaSQL , that offers the capability of uniform manipulation of data and meta-data in relational multi-database systems. We develop a precise syntax ... / schemas data models and in query processing etc.and systems issues br in Relational Multi-database Systems Laks V. S.
34 Optimal Multi-Step k-Nearest Neighbor Search - Seidl, Kriegel (1998)(Correct)
For an increasing number of modern database applications,
efficient support of similarity search becomes an
important task. Along with the complexity of the objects
such as images, molecules and mecha... / The use of a multi-step query processing strategy is recommended in br For an increasing number of modern database applications efficient support
32 Towards an Effective Calculus for Object Query Languages - Fegaras, Maier (1995)(Correct)
We define a standard of effectiveness for a database calculus
relative to a query language. Effectiveness judges suitability
to serve as a processing framework for the query language,
and comprises as... / handled in an ad hoc manner by query processors. The gap only widens as one br standard of effectiveness for a database calculus relative to a query
32 Describing and Using Query Capabilities of Heterogeneous Sources - Vassalos, Papakonstantinou (1997)(Correct)
Information integration systems have to cope
with the different and limited query interfaces
of the underlying information sources. First,
the integration systems need descriptions of
the query capabi... / this data is nontrivial. The query processing algorithm must infer from br of which are not conventional SQL database management systems. Examples of
32 Canonical representations for the geometries of multiple projective.. - Luong, Viéville (1994)(Correct)
This work is in the context of motion and stereo analysis. It presents a new unified representation
which will be useful when dealing with multiple views in the case of uncalibrated cameras.
Several l... / such as image database query processing virtual reality model br for applications such as image database query processing virtual
32 A Perspective on Databases and Data Mining - Kersten, Mannila, Toivonen (1995)(Correct)
We discuss the use of database methods for data mining. Recently impressive results have been achieved for
some data mining problems using highly specialized and clever data structures. We study how ... / H. . parallel systems query processing Information search and br REPORTRAPPORT A perspective on databases and data mining M. Holsheimer
32 Query Optimization for XML - McHugh, Widom (1999)(Correct)
XML is an emerging standard for data representation and exchange on the World-Wide Web. Due to the nature of information on the Web and the inherent flexibility of XML, we expect that much of the data... / This paper describes the query processor of Lore a DBMS for br more complicated notions of database statistics and vastly di erent
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 ... / order to support interactive query processing most commercial data br heterogeneous operational databases IK Wid Data warehouses
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... / INQUERY are document indexing query processing query expansion query br are document indexing query processing query expansion query evaluation
31 Providing Government Information on the Internet: Experiences with.. - Croft, Cook, Wilder (1995)(Correct)
The THOMAS system is designed to make legislative information available to the general public over the Internet, and can be regarded as a prototype of a government digital library. As a joint project ... / as TREC. Techniques such as query processing query expansion and br TREC. Techniques such as query processing query expansion and
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... / In order to speed up query processing in such environments br to be materialized either by the database administrator or by using an
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... / . Issues of Sample Query Processing 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... / Query Processing in Tertiary Memory Databases br Processing in Tertiary Memory Databases by Sunita Sarawagi Bachelor
29 Sequence Query Processing - Seshadri, Livny, Ramakrishnan (1994)(Correct)
Many applications require the ability to manipulate sequences
of data. We motivate the importance of sequence
query processing, and present a framework for the optimization
of sequence queries based o... / Sequence Query Processing Praveen Seshadri br physically stored as a sequence. Databases should a allow sequences to
29 Control of an Extensible Query Optimizer: A Planning-Based Approach - Gail Mitchell (1993)(Correct)
In this paper we address the problem of controlling the
execution of a query optimizer. We describe a control
for the optimization process that is based on planning.
The controller described here is a... / communicates with the query processing system. It receives a query br Query Optimization in Extensible Database Systems. PhD thesis Univ. of
28 MindReader: Querying databases through multiple examples - Ishikawa, Subramanya, Faloutsos (1998)(Correct)
Users often can not easily express their
queries. For example, in a multimedia/image
by content setting, the user might want photographs
with sunsets; in current systems,
like QBIC, the user has to gi... / we can apply it to vague query processing. As an example let us br MindReader Querying databases through multiple examples
28 Implementation of the CORAL Deductive Database System - Ramakrishnan, Srivastava, Sudarshan, .. (1993)(Correct)
CORAL is a deductive database system that supports a rich declarative language, provides a wide range of evaluation methods, and allows a combination of declarative and imperative programming. The dat... / of the storage manager. The query processing system consists of two main br of the CORAL Deductive Database System Raghu Ramakrishnan
27 On-Line Warehouse View Maintenance - Quass, Widom (1997)(Correct)
Data warehouses store materialized views over base data
from external sources. Clients typically perform complex
read-only queries on the views. The views are refreshed periodically
by maintenance tra... / views in order to speed up query processing HRU As changes are made br maintaining two versions of the database no locking is required and
27 Integrating Association Rule Mining with Relational Database Systems: .. - Sarawagi (1998)(Correct)
Data mining on large data warehouses is becoming increasingly
important. In support of this trend, we consider a
spectrum of architectural alternatives for coupling mining
with database systems. These... / of the database indexing and query processing capabilities thereby br Rule Mining with Relational Database Systems Alternatives and
27 Fast Incremental Indexing for Full-Text Information Retrieval - Brown, Callan, Croft (1994)(Correct)
Full-text information retrieval systems have traditionally been designed for archival environments. They often provide little or no support for adding new documents to an existing document collection,... / indexing and competitive query processing performance. Keywords br to the size of the existing database. . Query Processing The
27 Bitmap Index Design and Evaluation - Chan, Ioannidis (1998)(Correct)
Bitmap indexing has been touted as a promising approach for processing
complex adhoc queries in read-mostly environments, like
those of decision support systems. Nevertheless, only few possible
bitmap... / products to speed up query processing a notable example is Model br set of guidelines for physical database design using bitmap indexes.
27 Issues and Approaches to Design of Real-Time Database Systems - Singhal (1988)(Correct)
lizability
- user friendly interfaces
Sten F. Andler and Jörgen Hansson, Spring 1999 - 5
Performance Enhancement
"by High Cost"
Main Memory Database Systems (MMDBS)
Main Memory Resident Database Sy... / access methods and query processing optimize memory space br to Design of Real-Time Database Systems Mukesh Singhal Sten
27 Performance and Scalability of Client-Server Database Architectures - Delis, Roussopoulos (1992)(Correct)
Recent developments in software and hardware
changed the way database systems are built and
operate. In this paper we present database architectures
based on the Client--Server paradigm
and study ... / diskless workstations perform query processing and use their virtual memory br and Scalability of Client-Server Database Architectures Alexios Delis
26 Differential Evaluation of Continual Queries - Liu (1996)(Correct)
Information Superhighway environments such as the Internet have brought us ready access to large amount of information. However, Internet data is notoriously unorganized and autonomously managed in a ... / data incremental query processing interoperable information br support beyond traditional database techniques. Two of the key issues
26 Maintenance Expressions for Views with Aggregation - Dallan Quass(Correct)
Materialized views, especially views involving aggregation,
are often used in environments such as data warehouses to
speed up the evaluation of complex queries. Because the
views can be quite complex... / they are used to speed up query processing on large amounts of data. br that are computed and stored in a database are necessary to the success of
26 Computation of Stable Models and its Integration with Logical Query.. - Chen, Warren (1994)(Correct)
The well-founded semantics and the stable model semantics capture intuitions of the skeptical and credulous semantics in nonmonotonic reasoning, respectively. They represent the two dominant proposals... / its Integration with Logical Query Processing Weidong Chen br declarative semantics of deductive databases and logic programs. However
26 IRO-DB - A Distributed System Federating Object and Relational.. - Gardarin, Gannouni, Finance.. (1995)(Correct)
this paper adopts the federated approach to database interoperability [SL90] to overcome these limitations. Unlike homogeneous distributed database management systems, a federated database management ... / also the optimizer that plans query processing and the controller that br Federating Object and Relational Databases Georges Gardarin Sofiane
26 Cut and Paste - Atzeni, Mecca (1997)(Correct)
The paper develops Editor, a language for manipulating
semi-structured documents, such as the ones typically available
on the Web. Editor programs allow to search and restructure
a document. They are ... / regions in the text. Then query processing is based on these br in the Araneus project to build database views over Web sites.
26 A Performance Evaluation of Alternative Mapping Schemes for Storing.. - Florescu, Kossmann (1999)(Correct)
XML is emerging as one of the dominant data formats for data processing on the Internet. To query
XML data, query languages likeXQL, Lorel, XML-QL, or XML-GL have been proposed. In this paper,
we st... / database. Section addresses query processing issues. Section presents br Storing XML Data in a Relational Database Daniela Florescu Inria
26 CMD: A Multidimensional Declustering Method for Parallel Database.. - Li, Srivastava, Rotem (1992)(Correct)
I/O parallelism appears to be a promising approach to achieving high performance in
parallel database systems. In such systems, it is essential to decluster database files into fragments and
spread ... / parallel algorithms for range query processing and data maintenance are also br Declustering Method for Parallel Database Systems Jianzhong Li
26 DB2 Parallel Edition - Baru, Fecteau, Goyal, Hsiao.. (1995)(Correct)
The rate of increase in database size and response time requirements has outpaced
advancements in processor and mass storage technology. One way to satisfy the increasing
demand for processing power... / to provide the best query processing performance. The query br The rate of increase in database size and response time
25 Performance Tradeoffs for Client-Server Query Processing - Franklin, Jónsson, Kossmann (1996)(Correct)
The constructionof high-performancedatabasesystems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectures that can fully expl... / Tradeoffs for Client-Server Query Processing Michael J. Franklin Bj br of relational and object-oriented database systems. Relational database
24 Persistent Linda: Linda + Transactions + Query Processing - Brian Anderson (1991)(Correct)
this document use a "C" flavor of PLinda.
3 Tuple Patterns unknown Persistent Linda: Linda + Transactions + Query
Processing
Brian G. Anderson
and Dennis Shasha
Teradata Corp., 1919 Addison Ave., Be... / Linda Linda Transactions Query Processing Brian G. Anderson br unlike mathematical sets or database relations. Linda allows the
24 The Memory Performance of DSS Commercial Workloads in Shared-Memory.. - Trancoso (1997)(Correct)
Although cache-coherent shared-memory multiprocessors are often used to run commercial workloads, little work has been done to characterize how well these machines support such workloads. In particula... / some background material on query processing and the workload used br of Decision Support System DSS databases. Our analysis shows that the
24 The Stanford Data Warehousing Project - Hammer, Garcia-Molina, Widom, Labio, .. (1995)(Correct)
The goal of the data warehousing project at Stanford (the WHIPS project) is to develop algorithms and tools for the efficient collection and integration of information from heterogeneous and autonomou... / not a replacement to passive query processing schemes or to ad-hoc br disadvantages of federated database systems e.g.inefficiency
23 TIGUKAT: A Uniform Behavioral Objectbase Management System - Peters (1994)(Correct)
Object-oriented computing is influencing many areas of computer science, including database systems. Despite many advances, object-oriented computing is still in its infancy and a universally accepted... / incorporating queries and query processing as extensible parts of the br features such as query processing query optimization reflection
23 Evaluation of Signature Files as Set Access Facilities in OODBs - Ishikawa, Kitagawa, Ohbo (1993)(Correct)
Object-oriented database systems (OODBs) need efficient support for manipulation of complex objects. In particular, support of queries involving evaluations of set predicates is often required in hand... / set value manipulation in query processing. As access facilities to br ABSTRACT Object-oriented database systems OODBs need efficient
22 Incremental Clustering and Dynamic Information Retrieval - Charikar, Chekuri, Motwani (1997)(Correct)
Motivated by applications such as document and image
classification in information retrieval, we consider the problem
of clustering dynamic point sets in a metric space. We
propose a model called incr... / is used to accelerate query processing by considering only a small br A major issue that document databases are now facing is the extremely
22 Transactional Client-Server Cache Consistency: Alternatives and.. - Franklin, Carey, Livny (1995)(Correct)
Client-server database systems based on a page server model can exploit client memory resources
by caching copies of pages across transaction boundaries. Caching reduces the need to obtain data
from s... / systems perform most query processing in addition to application br Abstract Client-server database systems based on a page server
22 Algorithms for Materialized View Design in Data Warehousing.. - Yang, Karlapalem, Li (1997)(Correct)
Selecting views to materialize is one of the
most important decisions in designing a data
warehouse. In this paper, we present a framework
for analyzing the issues in selecting views
to materialize so... / any intermediate result from query processing to be materialized so that br distributed heterogeneous databases lazy or on-demand
22 Distributed Active Catalogs and Meta-Data Caching in Descriptive Name .. - Joann Ordille (1993)(Correct)
Today's global internetworks challenge the ability
of name services and other information services to locate
data quickly. We introduce a distributed active catalog
and meta-data caching for optimizin... / for information to speed query processing. Still others use semantic br in Figure . Many distributed database systems like Distributed INGRES
22 Query Optimization in the Presence of Limited Access Patterns - Florescu, Levy, Manolescu, Suciu (1999)(Correct)
We consider the problem of query optimization in the presence of limitations on access patterns to
the data (e.g., in order to obtain tuples of a relation, one must provide values for one of the attri... / optimization. Several recent query processing applications have the common br The goal of a query optimizer of a database system is to translate a
22 Modeling Uncertainty In Deductive Databases - Lakshmanan, Sadri (1994)(Correct)
Information Source Tracking (IST) method has been developed
recently for the modeling and manipulation of uncertain and inaccurate
data in relational databases. In this paper we extend the IST met... / fixpoint semantics. Query processing in this model is studied br Modeling Uncertainty In Deductive Databases Laks V. S. Lakshmanan
22 XML Query Languages: Experiences and Exemplars - Fernandez, Siméon, (eds.) (1999)(Correct)
This paper identifies essential features of an XML query language by examining four existing query languages: XML-QL, YA T L , Lorel, and XQL. The first three languages come from the database communit... / design query processing and optimization br three languages come from the database community and possess striking
22 Efficient User-Adaptable Similarity Search in Large Multimedia.. - Seidl, Kriegel (1997)(Correct)
Efficient user-adaptable similarity search more
and more increases in its importance for multimedia
and spatial database systems. As a general similarity
model for multi-dimensional vectors that is... / efficiently support ellipsoid query processing for various user-defined br Search in Large Multimedia Databases Thomas Seidl Hans-Peter
22 ODE (Object Database and Environment): The Language and the Data Model - Agrawal, Gehani (1989)(Correct)
ODE is a database system and environment based on the object paradigm. It offers one integrated data model for both database and general purpose manipulation. The database is defined, queried and mani... / join queries and that query processing smells of pointer chasing br ODE Object Database and Environment The Language
21 Extending a Data Base System with Procedures - Stonebraker, Anton, Hanson(Correct)
This paper suggests that more powerful data base systems (DBMS) can be built by supporting
data base procedures as full fledged data base objects. In particular, allowing fields of a data
base to be a... / how to asynchronously build query processing plans for user commands br CHEN Cheng J.et. al.IBM Database Performance Design
21 Probabilistic Datalog - a Logic for Powerful Retrieval Methods - Fuhr (1995)(Correct)
ing with
credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior
specific permission and/or a fee. Request permissions from Publications D... / see e.g. Ullman There query processing can be considered as finding br generalization of logical model of databases see e.g. Ullman There
21 A Quadtree Based Dynamic Attribute Indexing Method - Tayeb, Ulusoy, Wolfson (1997)(Correct)
Dynamic attributes are attributes that change continuously over time making it impractical to issue
explicit updates for every change. In this paper, we adapt a variant of the quadtree structure to so... / of performance focusing on query processing and index update overheads. br Grant CRG . the database community to deal effectively
21 On Indexing Mobile Objects - Kollios, Gunopulos, Tsotras (1999)(Correct)
We show how to index mobile objects in one and two dimensions using efficient dynamic external
memory data structures. The problem is motivated by real life applications in traffic monitoring,
intelli... / models query languages and query processing and optimization techniques br Introduction Traditional database management systems assume that
21 Agents for Information Gathering - Knoblock, Ambite (1997)(Correct)
pear in an evolutionary fashion, driven by the market forces of applications that can benefit from using them. We believe that this bottom-up approach can lead more realistically to the development of... / language and protocol query processing and learning capabilities. br sources include traditional databases flat files knowledge bases
21 Valid-time Indeterminacy - Dyreson, Snodgrass (1993)(Correct)
In valid-time indeterminacy, it is known that an event stored
in a temporal database did in fact occur, but it is not known
exactly when the event occurred. We present an extension of
the tuple-timest... / the information available to query processing. For instance given a br indeterminacy in its processing. Query evaluation efficiency should
21 NiagaraCQ: A Scalable Continuous Query System for Internet Databases - Chen, DeWitt, Tian, Wang (2000)(Correct)
Continuous queries are persistent queries that allow users to
receive new results when they become available. While
continuous query systems can transform a passive web into an
active environment, the... / supports scalable continuous query processing over multiple distributed br Query System for Internet Databases Jianjun Chen David J. DeWitt
20 Spatial Data Mining: A Database Approach - Ester, Kriegel, Sander (1997)(Correct)
Knowledge discovery in databases (KDD) is an important task in spatial
databases since both, the number and the size of such databases are rapidly
growing. This paper introduces a set of basic opera... / Neighborhood Graphs Efficient Query Processing. Introduction Spatial br Spatial Data Mining A Database Approach Martin Ester
20 Temporal Conditions and Integrity Constraints in Active Database.. - Sistla, Wolfson (1995)(Correct)
In this paper, we present a unified formalism, based on Past Temporal Logic, for specifying conditions and events in the rules for active database system. This language permits specification of many t... / top of and using the existing query processing system. Temporal integrity br Integrity Constraints in Active Database Systems A. Prasad Sistla
20 Practical Predicate Placement - Hellerstein (1994)(Correct)
Recent work in query optimization has addressed
the issue of placing expensive predicates in a query plan.
In this paper we explore the predicate placement options
considered in the Montage DBMS, pr... / Selection pushdown requires query processing to perform selections before br Introduction Relational Database Management Systems have begun to
19 Polynomial Time Query Processing in Temporal Deductive Databases - Chomicki (1990)(Correct)
We study conditions guaranteeing polynomial time computability
of queries in temporal deductive databases. We
show that if for a given set of temporal rules, the period
of its least models is bounded ... / Polynomial Time Query Processing in Temporal Deductive br Processing in Temporal Deductive Databases Jan Chomicki Department of
19 Multimedia Database Systems - The Notions and the Issues - Rakow, Neuhold, Löhr (1995)(Correct)
In this article, we give an overview of the usage of database systems in the emerging field of multimedia computing systems. We motivate that management of multimedia information requires support of... / database issues such as query processing user interaction and br Multimedia Database Systems The Notions and the
19 Fast Nearest Neighbor Search in High-dimensional Space - Berchtold, Ertl, Keim, Kriegel, Seidl (1998)(Correct)
Similarity search in multimedia databases requires an efficient
support of nearest-neighbor search on a large set of
high-dimensional points as a basic operation for query
processing. As recent theore... / as a basic operation for query processing. As recent theoretical br Similarity search in multimedia databases requires an efficient support
19 External Memory Algorithms and Data Structures - Vitter (1999)(Correct)
Data sets in large applications are often too massive to fit completely
inside the computer's internal memory. The resulting input/output
communication (or I/O) between fast internal memory and slow... / be preprocessed for efficient query processing or dynamic where the br TPIE in the domain of spatial databases. The newly developed EM
19 Finite Representation of Infinite Query Answers - Chomicki, Imielinski (1992)(Correct)
We define here a formal notion of finite representation of infinite query answers in
logic programs. We apply this notion to Datalog nS (Datalog with n successors): an extension of
Datalog capable ... / November Keywords query processing logic programming Datalog br To appear in ACM Transactions on Database Systems. A preliminary version
19 Using Probabilistic Information in Data Integration - Florescu, Koller, Levy (1997)(Correct)
The goal of a mediator system is to provide users
a uniform interface to the multitude of information
sources. To translate user queries, given in a
mediated schema, to queries on the data sources,
me... / poses a query the mediator's query processor uses the content br source described by the query Database Recovery Journal
19 Access Support Relations: An Indexing Method for Object Bases - Kemper, Moerkotte (1992)(Correct)
In this work access support relations are introduced as a means for optimizing query
processing in object-oriented database systems. The general idea is to maintain separate
structures (disassociated ... / as a means for optimizing query processing in object-oriented database br processing in object-oriented database systems. The general idea is to
19 Reducing the Braking Distance of an SQL Query Engine - Michael Carey (1998)(Correct)
In a recent paper, we proposed adding a STOP AFTER clause to
SQL to permit the cardinality of a query result to be explicitly limited
by query writers and query tools. We demonstrated the usefulness
o... / significant amount of wasted query processing. In a recent paper CK we br partitioning plans for processing Query in the absence of any
19 Learning Arbiter and Combiner Trees from Partitioned Data for Scaling .. - Philip Chan (1995)(Correct)
Knowledge discovery in databases has become an increasingly
important research topic with the advent of wide area
network computing. One of the crucial problems we study
in this paper is how to scale ... / employed in distributed query processing systems. Here we seek br Abstract Knowledge discovery in databases has become an increasingly
19 Multiversion Query Locking - Bober, Carey (1992)(Correct)
Multiversion two-phase locking (MV2PL) has been incorporated in some commercial transaction
processing systems to support the serializable execution of queries. A drawback to this algorithm
is the pot... / execute ad-hoc queries query processing is becoming an increasingly br Due to the adoption of relational database technology and the increasing
19 Typechecking for XML Transformers - Tova Milo Tel (2000)(Correct)
We study the typechecking problem for XML transformers:
given an XML transformation program and
a DTD for the input XML documents, check whether
every result of the program conforms to a specified
out... / information in relational query processing. Perhaps most importantly to br Introduction Traditionally database query languages have focused on
19 Optimizing Multi-Join Queries in Parallel Relational Databases - Srivastava, Elsesser (1993)(Correct)
Query optimization for parallel machines needs to
consider machine architecture, processor and memory
resources available, and different types of parallelism,
making the search space much larger than ... / pipelining parallelism to query processing. Query Plan br parallelism to query processing. Query Plan Representation Left-
18 Dynamic Memory Allocation for Multiple-Query Workloads - Manish Mehta (1993)(Correct)
This paper studies the problem of memory allocation and scheduling in a multiple query workload
with widely varying resource requirements. Several memory allocation and scheduling schemes
are presente... / by the users. Past research on query processing has dealt with issues of br for the popularity of relational database systems is their ability to
18 Data Mining and Database Systems: Where is the Intersection? - Chaudhuri (1998)(Correct)
this paper). This raises the question as
to what role, if any, database systems research may contribute to area of data mining. In this article, I will try
to present my biased view on this issue and ... / mining but also traditional query processing. For example some of the br Data Mining and Database Systems Where is the
18 Proximal Nodes: A Model to Query Document Databases by Content and.. - Navarro, Baeza-Yates (1997)(Correct)
this paper is to present a model to structure and query document
databases, following the new trend of mixing content and structure in queries. The
model is shown to be expressive and efficiently impl... / Management Systems Query processing H. Information Storage br computing collapse processing Query scope restricted to
18 The Garlic Project - Roth, al. (1996)(Correct)
eamlessly between querying and browsing activities,
using queries to identify interesting subsets of the database,
browsing the subset, querying the content of a setvalued
attribute of a particularly ... / that have limited query processing power. For example a br data that resides in different database systems as well as in a variety
18 Leveraging Mediator Cost Models with Heterogeneous Data Sources - Naacke, Gardarin, Tomasic (1998)(Correct)
Distributed systems require declarative access to diverse data sources of information. One approach
to solving this heterogeneous distributed database problem is based on mediator architectures. In ... / is registered. Then during query processing some standard cost br this heterogeneous distributed database problem is based on mediator
18 Selectivity Estimation in Spatial Databases - Acharya, Poosala, Ramaswamy (1999)(Correct)
Selectivity estimation of queries is an important and wellstudied
problem in relational database systems. In this paper,
we examine selectivity estimation in the context of Geographic
Information Syst... / rectangles MBRs and perform query processing with the MBRs as much as br Selectivity Estimation in Spatial Databases Swarup Acharya Viswanath
18 An Adaptive Query Execution System for Data Integration - Ives, Florescu, Friedman, Levy, Weld (1999)(Correct)
Query processing in data integration occurs over networkbound,
autonomous data sources. This requires extensions
to traditional optimization and execution techniques for three
reasons: there is an abs... / Abstract Query processing in data integration occurs br system from that of a traditional database system query reformulation the
18 On Wrapping Query Languages and Efficient XML Integration - Christophides, Cluet, Siméon (2000)(Correct)
Modern applications (portals, e-commerce, digital libraries, etc.) require integrated access
to various information sources (from traditional RDBMS to semistructured Web repositories),
fast deployme... / integration. However query processing in XML-based integration br highly structured is an object database that contains trading
18 Data Warehouse Configuration - Theodoratos, Sellis (1997)(Correct)
In the data warehousing approach to the integration
of data from multiple information
sources, selected information is extracted in
advance and stored in a repository. A data
warehouse (DW) can th... / high query performance low query processing cost is in conflict with br large distributed heterogeneous databases and other information sources