Sciweavers

828 search results - page 129 / 166
» An Evaluation of RDF Storage Systems for Large Data Applicat...
Sort
View
IMC
2009
ACM
14 years 3 months ago
Scalable proximity estimation and link prediction in online social networks
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
Han Hee Song, Tae Won Cho, Vacha Dave, Yin Zhang, ...
WLP
2004
Springer
14 years 1 months ago
SQL Based Frequent Pattern Mining with FP-Growth
Scalable data mining in large databases is one of today’s real challenges to database research area. The integration of data mining with database systems is an essential componen...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
RTS
2010
127views more  RTS 2010»
13 years 3 months ago
Scheduling of hard real-time garbage collection
Automatic memory management or garbage collection greatly simplifies development of large systems. However, garbage collection is usually not used in real-time systems due to the u...
Martin Schoeberl
SENSYS
2010
ACM
13 years 6 months ago
sMAP: a simple measurement and actuation profile for physical information
As more and more physical information becomes available, a critical problem is enabling the simple and efficient exchange of this data. We present our design for a simple RESTful ...
Stephen Dawson-Haggerty, Xiaofan Jiang, Gilman Tol...
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
14 years 2 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner