Sciweavers

2889 search results - page 187 / 578
» Querying Structured Hyperdocuments
Sort
View
OTM
2005
Springer
14 years 1 months ago
Taking Advantage of LOM Semantics for Supporting Lesson Authoring
Abstract. Learning Object Metadata (LOM) is an interoperable standard focused on enabling the reuse of learning material for authoring lessons. Nevertheless, few work was done on t...
Olivier Motelet, Nelson A. Baloian
BTW
2009
Springer
117views Database» more  BTW 2009»
13 years 11 months ago
Bringing BLINK Closer to the Full Power of SQL
: BLINK is a prototype of an in-memory based query processor that exploits heavily the underlying CPU infrastructure. It is very sensitive to the processor’s caches and instructi...
Knut Stolze, Vijayshankar Raman, Richard Sidle, O....
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
13 years 9 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
ICDE
2002
IEEE
149views Database» more  ICDE 2002»
14 years 9 months ago
GADT: A Probability Space ADT for Representing and Querying the Physical World
Large sensor networks are being widely deployed for measurement, detection, and monitoring applications. Many of these applications involve database systems to store and process d...
Anton Faradjian, Johannes Gehrke, Philippe Bonnet
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
14 years 19 days ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...