995 search results - page 67 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
112
click to vote
SIGMOD
2011
ACM
14 years 4 months ago
2011
ACM
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high ...
149
click to vote
SEBD
2001
15 years 3 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
133
click to vote
ICDE
2009
IEEE
15 years 8 months ago
2009
IEEE
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
130
click to vote
ICDE
2006
IEEE
15 years 8 months ago
2006
IEEE
Currently, only few XML data management systems support concurrent access to an XML document, and if they do, they typically apply variations of hierarchical locking to handle XML...
182
click to vote
ICDE
2012
IEEE
13 years 4 months ago
2012
IEEE
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...