Sciweavers

197 search results - page 12 / 40
» Efficiently approximating query optimizer plan diagrams
Sort
View
VLDB
2002
ACM
91views Database» more  VLDB 2002»
13 years 7 months ago
Parametric Query Optimization for Linear and Piecewise Linear Cost Functions
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
Arvind Hulgeri, S. Sudarshan
VLDB
2001
ACM
168views Database» more  VLDB 2001»
14 years 7 months ago
Answering queries using views: A survey
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
Alon Y. Halevy
ICDE
2010
IEEE
189views Database» more  ICDE 2010»
13 years 7 months ago
Caching all plans with just one optimizer call
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
Debabrata Dash, Ioannis Alagiannis, Cristina Maier...
TDM
2004
174views Database» more  TDM 2004»
13 years 8 months ago
Relational Approach to Logical Query Optimization of XPath
To be able to handle the ever growing volumes of XML documents, effective and efficient data management solutions are needed. Managing XML data in a relational DBMS has great pote...
Maurice van Keulen
AIPS
2009
13 years 8 months ago
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla