6654 search results - page 250 / 1331 » Querying Faceted Databases |
260
click to vote
ICDE
2001
IEEE
16 years 8 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
317
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
233
click to vote
XIMEP
2006
ACM
16 years 18 days ago
2006
ACM
We discuss query evaluation for XML-based server systems where the same query is evaluated on every incoming XML message. In a typical scenario, many of the incoming messages will...
189
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
303
click to vote
ICDE
1998
IEEE
16 years 8 months ago
1998
IEEE
We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment that is the first system to support an integrated approach to the direct manipulation specification o...