Sciweavers

2145 search results - page 149 / 429
» Answering Queries Using Views
Sort
View
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 9 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
133
Voted
VISUALIZATION
2005
IEEE
15 years 9 months ago
Query-Driven Visualization of Large Data Sets
We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is cons...
Kurt Stockinger, John Shalf, Kesheng Wu, E. Wes Be...
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 4 months ago
Relationship privacy: output perturbation for queries with joins
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
Vibhor Rastogi, Michael Hay, Gerome Miklau, Dan Su...
219
Voted
JUCS
2006
225views more  JUCS 2006»
15 years 3 months ago
Restricting the View and Connecting the Dots - Dangers of a Web Search Engine Monopoly
: Everyone realizes how powerful the few big Web search engine companies have become, both in terms of financial resources due to soaring stock quotes and in terms of the still hid...
Narayanan Kulathuramaiyer, Wolf-Tilo Balke
EDBT
2006
ACM
121views Database» more  EDBT 2006»
16 years 3 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin