443 search results - page 85 / 89 » System P: Completeness-driven Query Answering in Peer Data M... |
CIKM
2010
Springer
13 years 6 months 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...
BPM
2009
Springer
13 years 8 months ago
2009
Springer
Nowadays, all kinds of information systems store detailed information in logs. Examples of such systems include classical workflow management systems (Staffware), ERP systems (SAP)...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
BTW
2007
Springer
13 years 11 months ago
2007
Springer
Abstract: Content based multimedia retrieval is an important topic in database systems. An emerging and challenging topic in this area is the content based search in video data. A ...