11214 search results - page 2147 / 2243 » Just-in-time data structures |
188
click to vote
SIGMOD
2009
ACM
15 years 11 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...
110
click to vote
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing ...
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
105
click to vote
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
Recently, the Web has been rapidly "deepened" by many searchable databases online, where data are hidden behind query forms. For modelling and integrating Web databases,...
SIGMOD
2003
ACM
15 years 11 months ago
2003
ACM
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...