2375 search results - page 424 / 475 » Distributed Query Processing on the Web |
141
Voted
CIKM
2010
Springer
15 years 24 days ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
148
Voted
ICDT
2012
ACM
13 years 4 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
220
Voted
VLDB
2004
ACM
16 years 2 months ago
2004
ACM
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
128
Voted
BTW
2007
Springer
15 years 8 months ago
2007
Springer
: The emerging trend towards seamless monitoring of all business processes via comprehensive sensor networks – in particular RFID readers – creates new data management challeng...
127
Voted
DOLAP
2004
ACM
15 years 7 months ago
2004
ACM
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...