Sciweavers

6974 search results - page 211 / 1395
» Querying Semi-Structured Data
Sort
View
135
Voted
PLDI
2004
ACM
15 years 8 months ago
Parametric regular path queries
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
Yanhong A. Liu, Tom Rothamel, Fuxiang Yu, Scott D....
114
Voted
CIKM
2008
Springer
15 years 5 months ago
Evaluating partial tree-pattern queries on XML streams
The streaming evaluation is a popular way of evaluating queries on XML documents. Besides its many advantages, it is also the only option for a number of important XML application...
Xiaoying Wu, Dimitri Theodoratos
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
15 years 4 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
128
Voted
SDM
2009
SIAM
125views Data Mining» more  SDM 2009»
16 years 18 days ago
Providing Privacy through Plausibly Deniable Search.
Query-based web search is an integral part of many people’s daily activities. Most do not realize that their search history can be used to identify them (and their interests). I...
Chris Clifton, Mummoorthy Murugesan
114
Voted
PVLDB
2010
108views more  PVLDB 2010»
15 years 1 months ago
Retrieving Top-k Prestige-Based Relevant Spatial Web Objects
The location-aware keyword query returns ranked objects that are near a query location and that have textual descriptions that match query keywords. This query occurs inherently i...
Xin Cao, Gao Cong, Christian S. Jensen