1429 search results - page 95 / 286 » Efficient processing of XPath queries using indexes |
PVLDB
2008
13 years 8 months ago
2008
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
SIGMOD
2009
ACM
14 years 9 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
NSDI
2004
13 years 10 months ago
2004
This paper focuses on load management in looselycoupled federated distributed systems. We present a distributed mechanism for moving load between autonomous participants using bil...
SSDBM
2002
IEEE
14 years 1 months ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
ICDE
2003
IEEE
14 years 10 months ago
2003
IEEE
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...