1890 search results - page 204 / 378 » Querying Big Data by Accessing Small Data |
VLDB
1999
ACM
15 years 3 months ago
1999
ACM
When implementing persistent objects on a relational database, a major performance issue is prefetching data to minimize the number of roundtrips to the database. This is especial...
ISM
2006
IEEE
14 years 11 months ago
2006
IEEE
A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms...
105
click to vote
VLDB
2004
ACM
15 years 4 months ago
2004
ACM
XML languages, such as XQuery, XSLT and SQL/XML, employ XPath as the search and extraction language. XPath expressions often define complicated navigation, resulting in expensive...
118
click to vote
WMPI
2004
ACM
15 years 5 months ago
2004
ACM
The cache hierarchy design in existing SMT and superscalar processors is optimized for latency, but not for bandwidth. The size of the L1 data cache did not scale over the past dec...
212
click to vote
STOC
2003
ACM
15 years 11 months ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...