995 search results - page 29 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
114
click to vote
VLDB
1987
ACM
15 years 5 months ago
1987
ACM
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
175
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
Optimizing SQL subqueries has been an active area in database research and the database industry throughout the last decades. Previous work has already identified some approaches ...
124
click to vote
IDEAS
2006
IEEE
15 years 7 months ago
2006
IEEE
The paper presents a framework for publishing relational databases in textual documents such as mails, HTML pages, LATEX or BibTex files, plain texts, etc. The publication proces...
109
Voted
DEBS
2007
ACM
15 years 5 months ago
2007
ACM
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
110
click to vote
ADBIS
1998
Springer
15 years 6 months ago
1998
Springer
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...