Sciweavers

8763 search results - page 337 / 1753
» Querying Database Knowledge
Sort
View
283
Voted
ICDE
2009
IEEE
149views Database» more  ICDE 2009»
16 years 8 months ago
OPAQUE: Protecting Path Privacy in Directions Search
Directions search returns the shortest path from a source to a destination on a road network. However, the search interests of users may be exposed to the service providers, thus r...
Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Baih...
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 8 months ago
Counting Twig Matches in a Tree
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...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
16 years 6 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
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...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
XIMEP
2006
ACM
194views Database» more  XIMEP 2006»
16 years 21 days ago
Template Folding for XPath
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...
Carl-Christian Kanne, Guido Moerkotte
193
Voted
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
16 years 6 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
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...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...