Sciweavers

2145 search results - page 158 / 429
» Pattern-Based Query Answering
Sort
View
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
13 years 2 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
ICDE
2012
IEEE
291views Database» more  ICDE 2012»
13 years 11 months ago
Efficiently Monitoring Top-k Pairs over Sliding Windows
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, We...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 12 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
15 years 4 months ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
175
Voted
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
15 years 12 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu