Results 301 to 310 of about 1,336,530 (337)

Optimality in External Memory Hashing

Algorithmica, 2007
Hash tables on external memory are commonly used for indexing in database management systems. In this paper we present an algorithm that, in an asymptotic sense, achieves the best possible I/O and space complexities. Let B denote the number of records that fit in a block, and let N denote the total number of records. Our hash table uses $1+O(1/\sqrt{B})
Jensen, Morten Skaarup, Pagh, Rasmus
openaire   +3 more sources

External Memory Stream Sampling

Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2015
This paper aims to understand the I/O-complexity of maintaining a big sample set---whose size exceeds the internal memory's capacity---on a data stream. We study this topic in a new computation model, named the external memory stream (EMS) model, that naturally extends the standard external memory model to stream environments. A suite of EMS-indigenous
Yufei Tao, Miao Qiao, Xiaocheng Hu
openaire   +2 more sources

External Memory

2005
Publisher Summary This chapter elaborates various aspects of slow serial EEPROM devices and fast parallel static RAM (SRAM) chips. The I2C shares elements of both the 1-wire and SPI protocols but adds its own flavors. At any instant, one device on the I2C bus is the master and it communicates with a slave device.
openaire   +2 more sources

External Memory Data Structures

2001
In many massive dataset applications the data must be stored in space and query efficient data structures on external storage devices. Often the data needs to be changed dynamically. In this chapter we discuss recent advances in the development of provably worst-case efficient external memory dynamic data structures. We also briefly discuss some of the
openaire   +4 more sources

Viewsheds on terrains in external memory

SIGSPATIAL Special, 2012
Visibility is one of the fundamental problems on terrains. It is at the core of many applications, such as planning the placement of communication towers or watchtowers, planning buildings and roads such that they have a good view or such that they do not spoil somebody else's view, and finding routes on which you can travel while seeing a lot, or ...
openaire   +2 more sources

Social externalism, self-knowledge, and memory

Analysis, 1995
In [4], I argued that for an externalist, particularly a social externalist, slow-switching should be rather commonplace. Slow-switching (introduced by Burge [3]) occurs when an agent unknowingly moves between linguistic communities and thereby (unknowingly) adopts the linguistic norms of the new community.
openaire   +2 more sources

Efficient RDFS Entailment in External Memory

2011
The entailment of an RDF graph under the RDF Schema standard can easily become too costly to compute and maintain. It is often more desirable to compute on-demand whether a triple exists in the entailment. This is a non-trivial task likely to incur I/O costs, since RDF graphs are often too large to fit in internal memory.
Wouter J. Haffmans, George H. L. Fletcher   +1 more
openaire   +3 more sources

Flow Decompositions in External Memory

2013
Let G = (V,E) be a digraph with disjoint sets of sources S ⊂ V and sinks T ⊂ V endowed with an S–T flow f : E → ℤ + . It is a well-known fact that f decomposes into a sum ∑ st f st of s–t flows f st between all pairs of sources s ∈ S and sinks t ∈ T. In the usual RAM model, such a decomposition can be found in \(O(E \log \frac{V^2}{E})\) time.
openaire   +2 more sources

Externalism, self-knowledge, and memory

2015
This chapter discusses Paul Boghossian's ‘memory argument’ for the incompatibility of externalism and self-knowledge. The argument raises the question of whether or not, assuming externalism, the contents of our past thoughts are accessible to us through memory.
openaire   +2 more sources

EXTERNALISM AND MEMORY [PDF]

Southwest Philosophy Review, 2000
openaire   +1 more source