6905 search results - page 960 / 1381 » Querying Multidimensional Databases |
178
click to vote
SIGMOD
2012
ACM
13 years 7 months ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
241
click to vote
ICDE
2006
IEEE
16 years 6 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...
220
click to vote
SIGMOD
2006
ACM
16 years 5 months ago
2006
ACM
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
228
click to vote
SIGMOD
2005
ACM
16 years 5 months ago
2005
ACM
A windowed query operator breaks a data stream into possibly overlapping subsets of data and computes results over each. Many stream systems can evaluate window aggregate queries....
144
click to vote
EDBT
2006
ACM
16 years 5 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...