486 search results - page 31 / 98 » An Efficient Path Index for Querying Semi-structured Data |
209
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...
101
click to vote
WWW
2005
ACM
16 years 14 days ago
2005
ACM
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
COMPSAC
2004
IEEE
15 years 3 months ago
2004
IEEE
Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-mat...
102
click to vote
RP
2010
Springer
14 years 9 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
102
click to vote
DAWAK
1999
Springer
15 years 4 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...