3341 search results - page 314 / 669 » On Bounded Queries and Approximation |
318
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
283
Voted
VLDB
2007
ACM
16 years 7 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
151
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
182
click to vote
HAPTICS
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
177
click to vote
ADC
2007
Springer
16 years 28 days ago
2007
Springer
Histograms are used extensively for selectivity estimation and approximate query processing. Workloadaware dynamic histograms can self-tune itself based on query feedback without ...