Sciweavers

458 search results - page 29 / 92
» Fast and Simple Relational Processing of Uncertain Data
Sort
View
PEPM
2011
ACM
14 years 15 days ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
WAW
2010
Springer
270views Algorithms» more  WAW 2010»
14 years 7 months ago
Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
Pooya Esfandiar, Francesco Bonchi, David F. Gleich...
71
Voted
EDBT
2009
ACM
113views Database» more  EDBT 2009»
15 years 4 months ago
Supporting annotations on relations
Annotations play a key role in understanding and curating databases. Annotations may represent comments, descriptions, lineage information, among several others. Annotation manage...
Mohamed Y. Eltabakh, Walid G. Aref, Ahmed K. Elmag...
81
Voted
IPPS
1999
IEEE
15 years 1 months ago
Marshaling/Demarshaling as a Compilation/Interpretation Process
Marshaling is the process through which structured values are serialized into a stream of bytes; demarshaling converts this stream of bytes back to structured values. Most often, ...
Christian Queinnec
ISCA
1999
IEEE
96views Hardware» more  ISCA 1999»
15 years 1 months ago
PipeRench: A Coprocessor for Streaming multimedia Acceleration
Future computing workloads will emphasize an architecture's ability to perform relatively simple calculations on massive quantities of mixed-width data. This paper describes ...
Seth Copen Goldstein, Herman Schmit, Matthew Moe, ...