Sciweavers

817 search results - page 35 / 164
» Generating Efficient Plans for Queries Using Views
Sort
View
VLDB
1995
ACM
96views Database» more  VLDB 1995»
13 years 11 months ago
The Fittest Survives: An Adaptive Approach to Query Optimization
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
Hongjun Lu, Kian-Lee Tan, Son Dao
GIS
2006
ACM
14 years 8 months ago
Optimization of multiple continuous queries over streaming satellite data
Remotely sensed data, in particular satellite imagery, play many important roles in environmental applications and models. In particular applications that study (rapid) changes in...
Quinn Hart, Michael Gertz
ICDE
2010
IEEE
233views Database» more  ICDE 2010»
14 years 1 months ago
Polynomial heuristics for query optimization
— Research on query optimization has traditionally focused on exhaustive enumeration of an exponential number of candidate plans. Alternatively, heuristics for query optimization...
Nicolas Bruno, César A. Galindo-Legaria, Mi...
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 9 months ago
Auditing SQL Queries
We study the problem of auditing a batch of SQL queries: Given a forbidden view of a database that should have been kept confidential, a batch of queries that were posed over this ...
Rajeev Motwani, Shubha U. Nabar, Dilys Thomas
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...