552 search results - page 58 / 111 » Efficient Algorithms for Processing XPath Queries |
140
click to vote
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
Despite the existence of obstacles in many database applications, traditional spatial query processing utilizes the Euclidean distance metric assuming that points in space are dire...
132
click to vote
PVLDB
2008
15 years 2 months ago
2008
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
133
click to vote
SSDBM
2010
IEEE
15 years 22 days 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...
116
click to vote
WSDM
2010
ACM
16 years 8 days ago
2010
ACM
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
145
click to vote
COMAD
2008
15 years 4 months ago
2008
Answering aggregate queries like sum, count, min, max over regions containing moving objects is often needed for virtual world applications, real-time monitoring systems, etc. Sin...