486 search results - page 35 / 98 » An Efficient Path Index for Querying Semi-structured Data |
183
click to vote
SIGMOD
2009
ACM
16 years 1 days ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
146
click to vote
CINQ
2004
Springer
15 years 3 months ago
2004
Springer
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
195
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
214
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
168
click to vote
VLDB
2006
ACM
16 years 1 days ago
2006
ACM
For querying structured and semistructured data, data retrieval and document retrieval are two valuable and complementary techniques that have not yet been fully integrated. In thi...