Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,484
Data Exchange: Semantics and Query Answering
- In ICDT
, 2003
"... Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to the semantics of data exchange and to query answe ..."
Abstract
-
Cited by 427 (41 self)
- Add to MetaCart
Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to the semantics of data exchange and to query
Blobworld: A System for Region-Based Image Indexing and Retrieval
- In Third International Conference on Visual Information Systems
, 1999
"... . Blobworld is a system for image retrieval based on finding coherent image regions which roughly correspond to objects. Each image is automatically segmented into regions ("blobs") with associated color and texture descriptors. Querying is based on the attributes of one or two regions of ..."
Abstract
-
Cited by 375 (4 self)
- Add to MetaCart
. Blobworld is a system for image retrieval based on finding coherent image regions which roughly correspond to objects. Each image is automatically segmented into regions ("blobs") with associated color and texture descriptors. Querying is based on the attributes of one or two regions
Holistic twig joins: optimal XML pattern matching
- in: Proceedings of ACM SIGMOD International Conference on Management of Data, 2002
"... XML employs a tree-structured data model, and, naturally, XML queries specify patterns of selection predicates on multiple elements related by a tree structure. Finding all occurrences of such a twig pattern in an XML database is a core operation for XML query processing. Prior work has typically de ..."
Abstract
-
Cited by 344 (8 self)
- Add to MetaCart
to compactly represent partial results to root-to-leaf query paths, which are then composed to obtain matches for the twig pattern. When the twig pattern uses only ancestor-descendant relationships between elements, TwigStack is I/O and CPU optimal among all sequential algorithms that read the entire input
GLIMPSE: A Tool to Search Through Entire File Systems
, 1994
"... 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 the text --- and still allows very flexible full-text retrieval including Boolean queries, approxima ..."
Abstract
-
Cited by 215 (9 self)
- Add to MetaCart
, approximate matching (i.e., allowing misspelling) , and even searching for regular expressions. In a sense, glimpse extends agrep to entire file systems, while preserving most of its functionality and simplicity. Query times are typically slower than with inverted indexes, but they are still fast enough
An optimal and progressive algorithm for skyline queries
- In SIGMOD
, 2003
"... The skyline of a set of d-dimensional points contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerable attention in the database community, especially for progressive (or online) algorithms that can quickly return the firs ..."
Abstract
-
Cited by 225 (16 self)
- Add to MetaCart
the first skyline points without having to read the entire data file. Currently, the most efficient algorithm is NN (nearest neighbors), which applies the divideand-conquer framework on datasets indexed by R-trees. Although NN has some desirable features (such as high speed for returning the initial skyline
Answering queries using templates with binding patterns (Extended Abstract)
- IN PROC. OF THE 14TH ACM SIGACT SIGMOD SIGART SYMP. ON PRINCIPLES OF DATABASE SYSTEMS (PODS’95
, 1995
"... When integrating heterogeneous information re-sources, it is often the case that the source is rather limited in the kinds of queries it can answer. If a query is asked of the entire system, we have a new kind of optimization problem, in which we must try to express the given query in terms of the l ..."
Abstract
-
Cited by 216 (14 self)
- Add to MetaCart
When integrating heterogeneous information re-sources, it is often the case that the source is rather limited in the kinds of queries it can answer. If a query is asked of the entire system, we have a new kind of optimization problem, in which we must try to express the given query in terms
View-dependent simplification of arbitrary polygonal environments
, 1997
"... 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’s viewing position shifts, and adaptively, processing the entire database without first decomposing ..."
Abstract
-
Cited by 286 (15 self)
- Add to MetaCart
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’s viewing position shifts, and adaptively, processing the entire database without first decomposing
PATH PLANNING IN EXPANSIVE CONFIGURATION SPACES
, 1999
"... We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomlysampled milestones. The analysis of expansive configuration spaces has inspired us to develop a new randomized planning algorithm. ..."
Abstract
-
Cited by 264 (30 self)
- Add to MetaCart
. This new algorithm tries to sample only the portion of the configuration space that is relevant to the current query, avoiding the cost of precomputing a roadmap for the entire configuration space. Thus, it is wellsuited for problems where only a single query is submitted for a given environment
queries
"... Search engines are the gateway for users to retrieve information from the Web. There is a crucial need for tools that allow effective analysis of search engine queries to provide a greater understanding of Web users ' information seeking behavior. The objective of the study is to develop an eff ..."
Abstract
- Add to MetaCart
an effective strategy for the selection of samples from large-scale data sets. Millions of queries are submitted to Web search engines daily and new sampling techniques are required to bring these databases to a manageable size, while preserving the statistically representative characteristics of the entire
Using semi-joins to solve relational queries
- Journal of the ACM
, 1981
"... ABSTRACT. The semi-join is a relational algebraic operation that selects a set of tuples in one relation that match one or more tuples of another relation on the joining domains. Semi-joins have been used as a basic ingredient in query processing strategies for a number of hardware and software data ..."
Abstract
-
Cited by 126 (1 self)
- Add to MetaCart
database systems. However, not all queries can be solved entirely using semi-joins. In this paper the exact class of relational queries that can be solved using semi-joins is shown. It is also shown that queries outside of this class may not even be partially solvable using "short " semi
Results 1 - 10
of
1,484
