Sciweavers

14248 search results - page 79 / 2850
» Queries
Sort
View
ICPR
2008
IEEE
14 years 10 months ago
Query by table
Querying any information system requires the knowledge of some formal language, making it inaccessible to computer-na?ve potential users. We propose a new intuitive querying mecha...
George Nagy, Raghav K. Padmanabhan
ICALP
2009
Springer
14 years 9 months ago
On Cartesian Trees and Range Minimum Queries
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
Erik D. Demaine, Gad M. Landau, Oren Weimann
VLDB
2007
ACM
126views Database» more  VLDB 2007»
14 years 9 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
VLDB
2009
ACM
143views Database» more  VLDB 2009»
14 years 9 months ago
Sampling-based estimators for subset-based queries
We consider the problem of using sampling to estimate the result of an aggregation operation over a subset-based SQL query, where a subquery is correlated to an outer query by a NO...
Shantanu Joshi, Christopher M. Jermaine
SIGMOD
2009
ACM
135views Database» more  SIGMOD 2009»
14 years 9 months ago
Interactive plan hints for query optimization
Commercial database systems expose query hints to fix poor plans produced by the query optimizer. However, current query hints are not flexible enough to deal with a variety of no...
Nicolas Bruno, Surajit Chaudhuri, Ravishankar Rama...