Sciweavers

505 search results - page 27 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
VLDB
2007
ACM
143views Database» more  VLDB 2007»
15 years 10 months ago
OLAP over Imprecise Data with Domain Constraints
Several recent papers have focused on OLAP over imprecise data, where each fact can be a region, instead of a point, in a multidimensional space. They have provided a multiple-wor...
Douglas Burdick, AnHai Doan, Raghu Ramakrishnan, S...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 1 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
VLDB
2012
ACM
361views Database» more  VLDB 2012»
13 years 5 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
VLDB
2007
ACM
121views Database» more  VLDB 2007»
15 years 10 months ago
Efficient Keyword Search over Virtual XML Views
Emerging applications such as personalized portals, enterprise search and web integration systems often require keyword search over semi-structured views. However, traditional inf...
Feng Shao, Lin Guo, Chavdar Botev, Anand Bhaskar, ...
SIGMOD
2003
ACM
239views Database» more  SIGMOD 2003»
15 years 9 months ago
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
Chen Qun, Andrew Lim, Kian Win Ong