6004 search results - page 401 / 1201 » Parallelizing query optimization |
169
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
163
click to vote
ICDCSW
2006
IEEE
16 years 27 days ago
2006
IEEE
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...
197
Voted
ICS
2005
Tsinghua U.
16 years 11 days ago
2005
Tsinghua U.
We consider a cluster architecture in which dynamic content is generated by a database back-end and a collection of Web and application server front-ends. We study the effect of t...
278
Voted
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Database columns are often correlated, so that cardinality estimates computed by assuming independence often lead to a poor choice of query plan by the optimizer. Multidimensional...
187
Voted
WWW
2009
ACM
16 years 7 months ago
2009
ACM
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...