Results 11 - 20 of 19,880

Database Access In Intelligent Networks

by Kimmo Raatikainen , 1994
"... Future telecommunication services will extensively exploit database technology. Information needed in operations and management of telecommunication services will be organized as a logical entity. The world-wide nature of telecommunication dictates that the logical entity can only be realized throug ..."
Abstract - Cited by 9 (4 self) - Add to MetaCart
through interoperability of autonomous databases that may have different internal characteristics. We review the requirements for database access in the IN architecture. Our premises are derived from the IN long-term architecture framework as specified in ITU-T Recommendation Q.1201. 1. INTRODUCTION

Querying Heterogeneous Information Sources Using Source Descriptions

by Alon Levy, Anand Rajaraman, Joann Ordille , 1996
"... We witness a rapid increase in the number of structured information sources that are available online, especially on the WWW. These sources include commercial databases on product information, stock market information, real estate, automobiles, and entertainment. We would like to use the data stored ..."
Abstract - Cited by 724 (34 self) - Add to MetaCart
-featured database systems and can answer only a small set of queries over their data (for example, forms on the WWW restrict the set of queries one can ask). (3) Since the number of sources is very large, effective techniques are needed to prune the set of information sources accessed to answer a query. (4

Answering Queries Using Views: A Survey

by Alon Y. Halevy , 2000
"... The problem of answering queries using views is to find efficient methods of answering a query using a set of previously defined materialized views over the database, rather than accessing the database relations. The problem has recently received significant attention because of its relevance to a w ..."
Abstract - Cited by 562 (32 self) - Add to MetaCart
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously defined materialized views over the database, rather than accessing the database relations. The problem has recently received significant attention because of its relevance to a

Object exchange across heterogeneous information sources

by Yannis Papakonstantinou, Hector Garcia-molina, Jennifer Widom - INTERNATIONAL CONFERENCE ON DATA ENGINEERING , 1995
"... We address the problem of providing integrated access to diverse and dynamic information sources. We explain how this problem differs from the traditional database integration problem and we focus on one aspect of the information integration problem, namely information exchange. We define an object- ..."
Abstract - Cited by 510 (55 self) - Add to MetaCart
We address the problem of providing integrated access to diverse and dynamic information sources. We explain how this problem differs from the traditional database integration problem and we focus on one aspect of the information integration problem, namely information exchange. We define an object

The Ponder Policy Specification Language

by Nicodemos Damianou , Naranker Dulay , Emil Lupu , Morris Sloman - LECTURE NOTES IN COMPUTER SCIENCE , 2001
"... The Ponder language provides a common means of specifying security policies that map onto various access control implementation mechanisms for firewalls, operating systems, databases and Java. It supports obligation policies that are event triggered conditionaction rules for policy based management ..."
Abstract - Cited by 499 (28 self) - Add to MetaCart
The Ponder language provides a common means of specifying security policies that map onto various access control implementation mechanisms for firewalls, operating systems, databases and Java. It supports obligation policies that are event triggered conditionaction rules for policy based management

Optimal Aggregation Algorithms for Middleware

by Ronald Fagin, Amnon Lotem , Moni Naor - IN PODS , 2001
"... Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under ..."
Abstract - Cited by 717 (4 self) - Add to MetaCart
must access every object in the database, to find its grade under each attribute. Fagin has given an algorithm (“Fagin’s Algorithm”, or FA) that is much more efficient. For some monotone aggregation functions, FA is optimal with high probability in the worst case. We analyze an elegant and remarkably

Globus: A Metacomputing Infrastructure Toolkit

by Ian Foster, Carl Kesselman - International Journal of Supercomputer Applications , 1996
"... Emerging high-performance applications require the ability to exploit diverse, geographically distributed resources. These applications use high-speed networks to integrate supercomputers, large databases, archival storage devices, advanced visualization devices, and/or scientific instruments to for ..."
Abstract - Cited by 1929 (51 self) - Add to MetaCart
Emerging high-performance applications require the ability to exploit diverse, geographically distributed resources. These applications use high-speed networks to integrate supercomputers, large databases, archival storage devices, advanced visualization devices, and/or scientific instruments

Data Security

by Dorothy E. Denning, Peter J. Denning , 1979
"... The rising abuse of computers and increasing threat to personal privacy through data banks have stimulated much interest m the techmcal safeguards for data. There are four kinds of safeguards, each related to but distract from the others. Access controls regulate which users may enter the system and ..."
Abstract - Cited by 615 (3 self) - Add to MetaCart
and subsequently whmh data sets an active user may read or wrote. Flow controls regulate the dissemination of values among the data sets accessible to a user. Inference controls protect statistical databases by preventing questioners from deducing confidential information by posing carefully designed sequences

Fastmap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets

by Christos Faloutsos, King-Ip (David) Lin , 1995
"... A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]. Thus, we can subsequently use highly fine-tuned spatial access methods (SAMs), to answer several ..."
Abstract - Cited by 502 (22 self) - Add to MetaCart
A very promising idea for fast searching in traditional and multimedia databases is to map objects into points in k-d space, using k feature-extraction functions, provided by a domain expert [Jag91]. Thus, we can subsequently use highly fine-tuned spatial access methods (SAMs), to answer several

Lottery Scheduling: Flexible Proportional-Share Resource Management

by Carl A. Waldspurger, William E. Weihl , 1994
"... This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations. Such control is beyond the capabilities of conventional schedulers, and is desirable in systems that ..."
Abstract - Cited by 480 (5 self) - Add to MetaCart
that service requests of varying importance, such as databases, media-based applications, and networks. Lottery scheduling also supports modular resource management by enabling concurrent modules to insulate their resource allocation policies from one another. A currency abstraction is introduced to flexibly
Results 11 - 20 of 19,880