Sciweavers

327 search results - page 43 / 66
» Efficiently querying rdf data in triple stores
Sort
View
DAWAK
1999
Springer
14 years 27 days ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
HPDC
2010
IEEE
13 years 9 months ago
ROARS: a scalable repository for data intensive scientific computing
As scientific research becomes more data intensive, there is an increasing need for scalable, reliable, and high performance storage systems. Such data repositories must provide b...
Hoang Bui, Peter Bui, Patrick J. Flynn, Douglas Th...
CCS
2008
ACM
13 years 10 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
HT
2007
ACM
14 years 15 days ago
Lesson learnt from a large-scale industrial semantic web application
The design and maintenance of an aero-engine generates a significant amount of documentation. When designing new engines, engineers must obtain knowledge gained from maintenance o...
Sylvia C. Wong, Richard M. Crowder, Gary B. Wills,...
SIGMOD
2009
ACM
189views Database» more  SIGMOD 2009»
14 years 8 months ago
Query segmentation using conditional random fields
A growing mount of available text data are being stored in relational databases, giving rise to an increasing need for the RDBMSs to support effective text retrieval. In this pape...
Xiaohui Yu, Huxia Shi