Sciweavers

161 search results - page 21 / 33
» Efficiently Executing Information-Gathering Plans
Sort
View
GEOINFO
2003
15 years 1 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
VLDB
2001
ACM
127views Database» more  VLDB 2001»
15 years 12 months ago
Efficiently publishing relational data as XML documents
: XML is rapidly emerging as a standard for exchanging business data on the World Wide Web. For the foreseeable future, however, most business data will continue to be stored in re...
Jayavel Shanmugasundaram, Eugene J. Shekita, Rimon...
112
Voted
PODS
2006
ACM
138views Database» more  PODS 2006»
15 years 12 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
SIGMOD
2010
ACM
171views Database» more  SIGMOD 2010»
15 years 4 months ago
Variance aware optimization of parameterized queries
Parameterized queries are commonly used in database applications. In a parameterized query, the same SQL statement is potentially executed multiple times with different parameter ...
Surajit Chaudhuri, Hongrae Lee, Vivek R. Narasayya
JAIR
2006
157views more  JAIR 2006»
14 years 11 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...