14704 search results - page 2854 / 2941 » computing 2007 |
220
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
200
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
207
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
199
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
229
click to vote
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Recent advances in device technology and connectivity have paved the way for next generation applications that are data-driven, where data can reside anywhere, can be accessed at ...