Sciweavers

2001 search results - page 266 / 401
» Indexing in a Hypertext Database
Sort
View
ICDE
2004
IEEE
100views Database» more  ICDE 2004»
14 years 11 months ago
Simple, Robust and Highly Concurrent B-trees with Node Deletion
Why might B-tree concurrency control still be interesting? For two reasons: (i) currently exploited "real world" approaches are complicated; (ii) simpler proposals are n...
David B. Lomet
ICDE
2004
IEEE
144views Database» more  ICDE 2004»
14 years 11 months ago
Spatio-Temporal Aggregation Using Sketches
Several spatio-temporal applications require the retrieval of summarized information about moving objects that lie in a query region during a query interval (e.g., the number of m...
Yufei Tao, George Kollios, Jeffrey Considine, Feif...
WWW
2009
ACM
14 years 11 months ago
The recurrence dynamics of social tagging
How often do tags recur? How hard is predicting tag recurrence? What tags are likely to recur? We try to answer these questions by analysing the RSDC08 dataset, in both individual...
Dell Zhang, Robert Mao, Wei Li
VLDB
2002
ACM
124views Database» more  VLDB 2002»
14 years 10 months ago
Efficient retrieval of similar shapes
Abstract. We propose an indexing technique for the fast retrieval of objects in 2D images based on similarity between their boundary shapes. Our technique is robust in the presence...
Davood Rafiei, Alberto O. Mendelzon
SIGMOD
2008
ACM
141views Database» more  SIGMOD 2008»
14 years 10 months ago
SGL: a scalable language for data-driven games
We propose to demonstrate SGL, a language and system for writing computer games using data management techniques. We will demonstrate a complete game built using the system, and s...
Robert Albright, Alan J. Demers, Johannes Gehrke, ...