11211 search results - page 2177 / 2243 » (Data) STRUCTURES |
195
Voted
POPL
2003
ACM
16 years 1 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
216
Voted
SIGMOD
2009
ACM
16 years 1 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...
131
Voted
SIGMOD
2004
ACM
16 years 1 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 ...
118
Voted
SIGMOD
2004
ACM
16 years 1 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...
118
Voted
SIGMOD
2004
ACM
16 years 1 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,...