1429 search results - page 101 / 286 » Efficient processing of XPath queries using indexes |
SIGMOD
2009
ACM
14 years 9 months 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...
TMC
2008
13 years 8 months ago
2008
Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer. Efficient processing of LBSQs is of critical importance with the...
ICASSP
2011
IEEE
2011
IEEE
Efficient search of music pitch contours using wavelet transforms and segmented dynamic time warping
13 years 20 days ago
We propose a method of music melody matching based on their “continuous” (or “time-frame-based”) pitch contours. Most previous methods using frame-based contours either ma...
FOCS
2009
IEEE
14 years 25 days ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
SIGMOD
2007
ACM
14 years 9 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...