Sciweavers

1238 search results - page 49 / 248
» View-based query containment
Sort
View
SIGMOD
2009
ACM
147views Database» more  SIGMOD 2009»
15 years 10 months ago
XML keyword query refinement
Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, ...
Jiaheng Lu, Zhifeng Bao, Tok Wang Ling, Xiaofeng M...
DEXA
1998
Springer
124views Database» more  DEXA 1998»
15 years 2 months ago
Indexing Time-Series Databases for Inverse Queries
Abstract. In this paper we examine the problem of indexing time sequences in order to answer inverse queries. An inverse query computes all the time points at which the sequence co...
Alexandros Nanopoulos, Yannis Manolopoulos
CCCG
2008
14 years 11 months ago
Data Structures for Range-Aggregate Extent Queries
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Mich...
PVLDB
2008
101views more  PVLDB 2008»
14 years 9 months ago
Output perturbation with query relaxation
Given a dataset containing sensitive personal information, a statistical database answers aggregate queries in a manner that preserves individual privacy. We consider the problem ...
Xiaokui Xiao, Yufei Tao
ISAAC
2004
Springer
121views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Approximate Distance Oracles for Graphs with Dense Clusters
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
Mattias Andersson, Joachim Gudmundsson, Christos L...