6004 search results - page 582 / 1201 » Parallelizing query optimization |
139
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is ...
164
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper considers a method for learning a distance metric in a fingerprinting system which identifies a query content by measuring the distance between the fingerprint of th...
152
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We propose a Smart Trend-Traversal (STT) protocol for RFID tag arbitration, which effectively reduces the collision overhead occurred in the arbitration process. STT, a Query Tr...
147
click to vote
ICLP
2007
Springer
16 years 17 days ago
2007
Springer
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
148
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...