2889 search results - page 266 / 578 » Querying Structured Hyperdocuments |
166
click to vote
FOCS
2009
IEEE
15 years 8 months 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...
135
Voted
COMPGEOM
2005
ACM
15 years 7 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
174
click to vote
WWW
2006
ACM
16 years 5 months ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
172
click to vote
CIKM
2011
Springer
14 years 5 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
155
click to vote
ICDE
2010
IEEE
15 years 12 months ago
2010
IEEE
— Previous studies on supporting keyword queries in RDBMSs provide users with a ranked list of relevant linked structures (e.g. joined tuples) or individual tuples. In this paper...