486 search results - page 32 / 98 » An Efficient Path Index for Querying Semi-structured Data |
172
click to vote
SIGMOD
2009
ACM
16 years 19 hour ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
106
click to vote
SSDBM
2010
IEEE
14 years 9 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...
109
click to vote
WSDM
2010
ACM
15 years 9 months ago
2010
ACM
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
SSDBM
1998
IEEE
15 years 4 months ago
1998
IEEE
: A new issue that arises in modern applications involves the efficient manipulation of (static or moving) spatial objects, and the relationships among them. As a result, modern da...
168
click to vote
ICDT
2009
ACM
16 years 15 days ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...