Sciweavers

145 search results - page 13 / 29
» Data summaries for on-demand queries over linked data
Sort
View
ISEMANTICS
2010
14 years 11 months ago
Live linked open sensor database
There are millions of sensors being deployed all over the world. Data generated by these sensors is provided in different formats and interfaces and is rarely associated with sema...
Danh Le Phuoc, Josiane Xavier Parreira, Michael Ha...
SOFSEM
2005
Springer
15 years 2 months ago
RAQ: A Range-Queriable Distributed Data Structure
Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized and decentralized memory structure. In this paper, a simple range...
Hamid Nazerzadeh, Mohammad Ghodsi
WSDM
2009
ACM
114views Data Mining» more  WSDM 2009»
15 years 4 months ago
Wikipedia pages as entry points for book search
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...
Marijn Koolen, Gabriella Kazai, Nick Craswell
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
15 years 9 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
15 years 3 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm