486 search results - page 28 / 98 » An Efficient Path Index for Querying Semi-structured Data |
111
click to vote
SSD
2005
Springer
15 years 5 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
101
click to vote
LREC
2008
15 years 1 months ago
2008
Being the client's first interface, call centres worldwide contain a huge amount of information of all kind under the form of conversational speech. If accessible, this infor...
134
click to vote
ESWS
2009
Springer
14 years 9 months ago
2009
Springer
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
227
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
101
click to vote
DEXA
2008
Springer
15 years 1 months ago
2008
Springer
The query performance for tracing tags depends upon the distribution of tag trajectories in the data space. We examine a more efficient representation of tag trajectories by means ...