995 search results - page 54 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
181
click to vote
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
Relational DBMS typically execute concurrent queries independently by invoking a set of operator instances for each query. To exploit common data retrievals and computation in con...
200
click to vote
VLDB
2002
ACM
16 years 2 months ago
2002
ACM
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
124
click to vote
IDEAS
2005
IEEE
15 years 7 months ago
2005
IEEE
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
140
click to vote
CIDR
2011
14 years 5 months ago
2011
For some problems, human assistance is needed in addition to automated (algorithmic) computation. In sharp contrast to existing data management approaches, where human input is ei...
195
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...