Results 1 - 10 of 1,724

Query evaluation techniques for large databases

by Goetz Graefe - ACM COMPUTING SURVEYS , 1993
"... Database management systems will continue to manage large data volumes. Thus, efficient algorithms for accessing and manipulating large sets and sequences will be required to provide acceptable performance. The advent of object-oriented and extensible database systems will not solve this problem. On ..."
Abstract - Cited by 767 (11 self) - Add to MetaCart
-relational database systems, including iterative execution of complex query evaluation plans, the duality of sort- and hash-based set matching algorithms, types of parallel query execution and their implementation, and special operators for emerging database application domains.

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
of statistical queries and correlating the responses. Statlstmal data banks are much less secure than most people beheve. Data encryption attempts to prevent unauthorized disclosure of confidential information in transit or m storage. This paper describes the general nature of controls of each type, the kinds

Efficient algorithms for geometric optimization

by Pankaj K. Agarwal, Micha Sharir - ACM Comput. Surv , 1998
"... We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several techniques used to attack these problems, such as parametric searching, geometric alternatives to parametric searching, prune-and-search techniques for linear progra ..."
Abstract - Cited by 114 (10 self) - Add to MetaCart
and intersection of polygons and polyhedra, and ray shooting and other query-type problems.

Non-Malleable Cryptography

by Danny Dolev, Cynthia Dwork, Moni Naor - SIAM Journal on Computing , 2000
"... The notion of non-malleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract - Cited by 480 (20 self) - Add to MetaCart
system users. Our cryptosystem is the first proven to be secure against a strong type of chosen ciphertext attack proposed by Rackoff and Simon, in which the attacker knows the ciphertext she wishes to break and can query the decryption oracle on any ciphertext other than the target.

Query expansion using lexical-semantic relations

by Ellen M. Voorhees - In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval , 1994
"... Applications such as office automation, news filtering, help facilities in complex systems, and the like require the ability to retrieve documents from full-text databases where vocabulary problems can be particularly severe. Experiments performed on small collections with single-domain thesauri sug ..."
Abstract - Cited by 395 (1 self) - Add to MetaCart
suggest that expanding query vectors with words that are lexically related to the original query words can ameliorate some of the problems of mismatched vocabularies. This paper examines the utility of lexical query expansion in the large, diverse TREC collection. Concepts are represented by Word

On the Decidability of Query Containment under Constraints

by Diego Calvanese, Giuseppe De Giacomo, et al.
"... Query containment under constraints is the problem of checking whether for every database satisfying a given set of constraints, the result of one query is a subset of the result of another query. Recent research points out that this is a central problem in several database applications, and we addr ..."
Abstract - Cited by 256 (56 self) - Add to MetaCart
Query containment under constraints is the problem of checking whether for every database satisfying a given set of constraints, the result of one query is a subset of the result of another query. Recent research points out that this is a central problem in several database applications, and we

Query Type Classification for Web Document Retrieval

by In-ho Kang, et al. - IN PROCEEDINGS OF THE 26TH ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL , 2003
"... The heterogeneous Web exacerbates IR problems and short user queries make them worse. The contents of web documents are not enough to find good answer documents. Link information and URL information compensates for the insu #ciencies of content information. However, static combination of multiple ev ..."
Abstract - Cited by 109 (1 self) - Add to MetaCart
The heterogeneous Web exacerbates IR problems and short user queries make them worse. The contents of web documents are not enough to find good answer documents. Link information and URL information compensates for the insu #ciencies of content information. However, static combination of multiple

Similarity search for web services

by Xin Dong, Alon Halevy, Jayant Madhavan, Ema Nemes, Jun Zhang - In Proc. of VLDB , 2004
"... Web services are loosely coupled software components, published, located, and invoked across the web. The growing number of web services available within an organization and on the Web raises a new and challenging search problem: locating desired web services. Traditional keyword search is insuffici ..."
Abstract - Cited by 205 (5 self) - Add to MetaCart
is insufficient in this context: the specific types of queries users require are not captured, the very small text fragments in web services are unsuitable for keyword search, and the underlying structure and semantics of the web services are not exploited. We describe the algorithms underlying the Woogle search

Jungloid Mining: Helping To Navigate the API Jungle

by David Mandelin, Lin Xu, Rastislav Bodík, Doug Kimelman - Proceedings of the 2005 SIGPLAN Conference on Programming Languages Design and Implementation
"... Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We observed that a common scenario is that the programmer knows what type of object he needs, but does not know how to write the c ..."
Abstract - Cited by 174 (1 self) - Add to MetaCart
the code to get the object. In order to help programmers write API client code more easily, we developed techniques for synthesizing jungloid code fragments automatically given a simple query that describes that desired code in terms of input and output types. A jungloid is simply a unary expression

The type-consistency problem for queries in objectoriented databases,” NAIST

by Yasunori Ishihara, Hiroyuki Seki, Minoru Ito , 1998
"... This paper discusses the computational complexity of type consistency problems for queries in object-oriented databases (OODBs). A database instance is said to be consistent under a database schema if, for every method invocation $m $ , the definition of $m $ to be bound is uniquely determined. In t ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
This paper discusses the computational complexity of type consistency problems for queries in object-oriented databases (OODBs). A database instance is said to be consistent under a database schema if, for every method invocation $m $ , the definition of $m $ to be bound is uniquely determined
Results 1 - 10 of 1,724