1007 search results - page 54 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
133
click to vote
GEOINFO
2003
15 years 3 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
103
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
156
click to vote
WWW
2010
ACM
15 years 9 months ago
2010
ACM
The Semantic Web community, until now, has used traditional database systems for the storage and querying of RDF data. The SPARQL query language also closely follows SQL syntax. A...
146
click to vote
CF
2007
ACM
15 years 6 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
130
click to vote
DASFAA
2006
IEEE
15 years 8 months ago
2006
IEEE
As business and enterprises generate and exchange XML data more often, there is an increasing need for searching and querying XML data. A lot of researches have been done to match ...