Sciweavers

3891 search results - page 454 / 779
» Query Models
Sort
View
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 4 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
CIKM
2010
Springer
15 years 2 months ago
Examining the information retrieval process from an inductive perspective
Term-weighting functions derived from various models of retrieval aim to model human notions of relevance more accurately. However, there is a lack of analysis of the sources of e...
Ronan Cummins, Mounia Lalmas, Colm O'Riordan
ICDE
2007
IEEE
118views Database» more  ICDE 2007»
16 years 5 months ago
Fine Grained Authorization Through Predicated Grants
Authorization in SQL is currently at the level of tables or columns. Many applications need a finer level of control. We propose a model for fine-grained authorization based on ad...
Surajit Chaudhuri, Tanmoy Dutta, S. Sudarshan
DEXA
2006
Springer
116views Database» more  DEXA 2006»
15 years 6 months ago
Interpolating and Using Most Likely Trajectories in Moving-Objects Databases
In recent years, many emerging database applications deal with large sets of continuously moving data objects. Since no computer system can commit continuously occurring infinitesi...
Byunggu Yu, Seon Ho Kim
STACS
2007
Springer
15 years 10 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom