481 search results - page 62 / 97 » Approximate XML Query Answers |
EDBTW
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In recent times, the proliferation of spatial data on the Internet is beginning to allow a much larger audience to access and share data currently available in various Ge...
170
click to vote
SIGMOD
2007
ACM
15 years 12 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
SIGIR
2009
ACM
15 years 6 months ago
2009
ACM
Type-ahead search is a new information-access paradigm, in which systems can find answers to keyword queries “onthe-fly” as a user types in a query. It improves traditional ...
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...