995 search results - page 102 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
127
Voted
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
141
click to vote
DBA
2004
15 years 4 months ago
2004
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...
215
click to vote
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
The high quality, structured data from Web structured sources is invaluable for many applications. Hidden Web databases are not directly crawlable by Web search engines and are on...
105
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
148
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
XML data warehouses form an interesting basis for decision-support applications that exploit complex data. However, native XML database management systems currently bear limited p...