552 search results - page 87 / 111 » Efficient Algorithms for Processing XPath Queries |
107
click to vote
CIKM
1994
Springer
15 years 3 months ago
1994
Springer
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
92
Voted
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
106
click to vote
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
178
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
XML schema design has two opposing goals: elimination of update anomalies requires that the schema be as normalized as possible; yet higher query performance and simpler query exp...
96
Voted
WWW
2007
ACM
16 years 13 days ago
2007
ACM
Although personalized search has been proposed for many years and many personalization strategies have been investigated, it is still unclear whether personalization is consistent...