Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,079
Tree Pattern Query Minimization
"... Tree patterns form a natural basis to query treestructured data such as XML and LDAP. To improve the efficiency of tree pattern matching, it is essential to quickly identify and eliminate redundant nodes in the pattern. In this paper, we study tree pattern minimization both in the absence and in the ..."
Abstract
-
Cited by 58 (0 self)
- Add to MetaCart
Tree patterns form a natural basis to query treestructured data such as XML and LDAP. To improve the efficiency of tree pattern matching, it is essential to quickly identify and eliminate redundant nodes in the pattern. In this paper, we study tree pattern minimization both in the absence
A Scalable Algorithm for Query Minimization
, 2002
"... Minimizing a query means finding an equivalent one with the least number of joins. Although this problem was conceived over 25 years ago, no scalable algorithm exists today for several reasons. First, the problem is NP-hard even for conjunctive queries, which seems to preclude a universally fast alg ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
Minimizing a query means finding an equivalent one with the least number of joins. Although this problem was conceived over 25 years ago, no scalable algorithm exists today for several reasons. First, the problem is NP-hard even for conjunctive queries, which seems to preclude a universally fast
Answering queries using views
- In PODS Conference
, 1995
"... We consider the problem of computing answers to queries by using materialized views. Aside from its potential in optimizing query evaluation, the problem also arises in applications such as Global Information Systems, Mobile Computing and maintaining physical data independence. We consider the probl ..."
Abstract
-
Cited by 447 (32 self)
- Add to MetaCart
the problem of nding a rewriting of a query that uses the materialized views, the problem of nding minimal rewritings, and nding complete rewritings (i.e., rewritings that use only the views). We show that all the possible rewritings can be obtained by considering containment mappings from the views
NiagaraCQ: A Scalable Continuous Query System for Internet Databases
- In SIGMOD
, 2000
"... 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, they need to be able to support millions of queries due to the scale of the Internet. No existing syste ..."
Abstract
-
Cited by 584 (9 self)
- Add to MetaCart
are added to existing query groups, without having to regroup already installed queries. Second, we use a query-split scheme that requires minimal changes to a general-purpose query engine. Third, NiagaraCQ groups both change-based and timer-based queries in a uniform way. To insure that Niagara
Document Language Models, Query Models, and Risk Minimization for Information Retrieval
- In Proceedings of SIGIR’01
, 2001
"... ..."
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
, 2001
"... This paper presents and evaluates the storage management and caching in PAST, a large-scale peer-to-peer persistent storage utility. PAST is based on a self-organizing, Internetbased overlay network of storage nodes that cooperatively route file queries, store multiple replicas of files, and cache a ..."
Abstract
-
Cited by 803 (23 self)
- Add to MetaCart
and to balance the query load. We present and evaluate PAST, with an emphasis on its storage management and caching system. Extensive tracedriven experiments show that the system minimizes fetch distance, that it balances the query load for popular files, and that it displays graceful degradation of performance
The use of MMR, diversity-based reranking for reordering documents and producing summaries
- In SIGIR
, 1998
"... jadeQcs.cmu.edu Abstract This paper presents a method for combining query-relevance with information-novelty in the context of text retrieval and summarization. The Maximal Marginal Relevance (MMR) criterion strives to reduce redundancy while maintaining query relevance in re-ranking retrieved docum ..."
Abstract
-
Cited by 768 (14 self)
- Add to MetaCart
“marginal relevance ”- i.e. a document has high marginal relevance if it is both relevant to the query and contains minimal similarity to previously selected documents. We strive to maximize-marginal relevance in retrieval and summarization, hence we label our method “maximal marginal relevanci ” (MMR).
Optimizing Search Engines using Clickthrough Data
, 2002
"... This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system should present relevant documents high in the ranking, with less relevant documents following below. While previous approaches ..."
Abstract
-
Cited by 1314 (23 self)
- Add to MetaCart
theoretical perspective, this method is shown to be well-founded in a risk minimization framework. Furthermore, it is shown to be feasible even for large sets of queries and features. The theoretical results are verified in a controlled experiment. It shows that the method can effectively adapt the retrieval
Markov Logic Networks
- MACHINE LEARNING
, 2006
"... We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects in the ..."
Abstract
-
Cited by 816 (39 self)
- Add to MetaCart
in the domain, it specifies a ground Markov network containing one feature for each possible grounding of a first-order formula in the KB, with the corresponding weight. Inference in MLNs is performed by MCMC over the minimal subset of the ground network required for answering the query. Weights are efficiently
The Temporal Query Language TQuel
- ACM Transactions on Database Systems
, 1987
"... This paper defines aggregates in the temporal query language TQuel and provides their rormal semantics in the tuple relational calculus. A rormal semantics (or Que! aggregates is defined in the process. Multiple aggregates; aggregates appearing in the where, when, valid, and as-or clauses; nested ag ..."
Abstract
-
Cited by 332 (45 self)
- Add to MetaCart
This paper defines aggregates in the temporal query language TQuel and provides their rormal semantics in the tuple relational calculus. A rormal semantics (or Que! aggregates is defined in the process. Multiple aggregates; aggregates appearing in the where, when, valid, and as-or clauses; nested
Results 1 - 10
of
3,079
