Sciweavers

2797 search results - page 364 / 560
» Code query by example
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
170
Voted
EDBT
2004
ACM
174views Database» more  EDBT 2004»
16 years 4 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
EDBT
2008
ACM
106views Database» more  EDBT 2008»
16 years 4 months ago
Highly scalable trip grouping for large-scale collective transportation systems
Transportation?related problems, like road congestion, parking, and pollution, are increasing in most cities. In order to reduce traffic, recent work has proposed methods for vehi...
Gyözö Gidófalvi, Torben Bach Pede...
ICCS
2009
Springer
15 years 10 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 10 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan