1172 search results - page 117 / 235 » Indexing XML Data Stored in a Relational Database |
ADC
2008
Springer
14 years 12 months ago
2008
Springer
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus o...
ALPIT
2007
IEEE
15 years 4 months ago
2007
IEEE
While information retrieval (IR) and databases (DB) have been developed independently, there have been emerging requirements that both data management and efficient text retrieva...
198
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
179
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
SISAP
2008
IEEE
15 years 4 months ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...