6650 search results - page 1078 / 1330 » Mutating database queries |
158
click to vote
CIKM
2010
Springer
15 years 2 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...
151
click to vote
SSDBM
2010
IEEE
15 years 2 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
141
click to vote
WWW
2008
ACM
16 years 4 months ago
2008
ACM
Because of the high volume and unpredictable arrival rate, stream processing systems may not always be able to keep up with the input data streams-- resulting in buffer overflow a...
143
click to vote
CLEF
2007
Springer
15 years 10 months ago
2007
Springer
This paper describes our first participation in the Indian language sub-task of the main Adhoc monolingual and bilingual track in CLEF1 competition. In this track, the task is to...
164
click to vote
ER
2004
Springer
15 years 9 months ago
2004
Springer
The envisioned Semantic Web aims to provide richly annotated and explicitly structured Web pages in XML, RDF, or description logics, based upon underlying ontologies and thesauri. ...