Salvatore Orlando
Salvatore Orlando
Professor of Computer Science, Universitą Ca' Foscari Venezia, Italy
Verified email at unive.it - Homepage
TitleCited byYear
P3 L: A structured high‐level parallel language, and its structured support
B Bacci, M Danelutto, S Orlando, S Pelagatti, M Vanneschi
Concurrency: practice and experience 7 (3), 225-255, 1995
2911995
Fast and memory efficient mining of frequent closed itemsets
C Lucchese, S Orlando, R Perego
IEEE Transactions on Knowledge and Data Engineering 18 (1), 21-36, 2005
2452005
Boosting the performance of web search engines: Caching and prefetching query results by exploiting historical usage data
T Fagni, R Perego, F Silvestri, S Orlando
ACM Transactions on Information Systems (TOIS) 24 (1), 51-78, 2006
2372006
Enhancing the Apriori Algorithm for Frequent Set Counting
R Perego, S Orlando, P Palmerini
International Conference on Data Warehousing and Knowledge Discovery, 71-82, 2001
1502001
Identifying task-based sessions in search engine query logs
C Lucchese, S Orlando, R Perego, F Silvestri, G Tolomei
Proceedings of the fourth ACM international conference on Web search and …, 2011
1442011
Adaptive and resource-aware mining of frequent sets
S Orlando, P Palmerini, R Perego, F Silvestri
2002 IEEE International Conference on Data Mining, 2002. Proceedings., 338-345, 2002
1432002
A methodology for the development and the support of massively parallel programs
M Danelutto, R Di Meglio, S Orlando, S Pelagatti, M Vanneschi
Future Generation Computer Systems 8 (1-3), 205-220, 1992
1391992
Trajectory data warehouses: design and implementation issues
S Orlando, R Orsini, A Raffaetą, A Roncato, C Silvestri
Journal of computing science and engineering 1 (2), 211-232, 2007
882007
Learning relatedness measures for entity linking
D Ceccarelli, C Lucchese, S Orlando, R Perego, S Trani
Proceedings of the 22nd ACM international conference on Information …, 2013
852013
kDCI: a multi-strategy algorithm for mining frequent sets
S Orlando, C Lucchese, P Palmerini, R Perego, F Silvestri
IEEE ICDM’03 Workshop FIMI’03, 2003
81*2003
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets.
C Lucchese, S Orlando, R Perego
FIMI, 2004
752004
A new algorithm for gap constrained sequence mining
S Orlando, R Perego, C Silvestri
Proceedings of the 2004 ACM symposium on Applied computing, 540-547, 2004
712004
Dexter: an open source framework for entity linking
D Ceccarelli, C Lucchese, S Orlando, R Perego, S Trani
Proceedings of the sixth international workshop on Exploiting semantic …, 2013
692013
Peer-to-peer systems for discovering resources in a dynamic grid
M Marzolla, M Mordacchini, S Orlando
Parallel Computing 33 (4-5), 339-358, 2007
692007
Assigning identifiers to documents to enhance the clustering property of fulltext indexes
F Silvestri, S Orlando, R Perego
Proceedings of the 27th annual international ACM SIGIR conference on …, 2004
682004
Resource discovery in a dynamic grid environment
M Marzolla, M Mordacchini, S Orlando
16th International Workshop on Database and Expert Systems Applications …, 2005
622005
Discovering tasks from search engine query logs
C Lucchese, S Orlando, R Perego, F Silvestri, G Tolomei
ACM Transactions on Information Systems (TOIS) 31 (3), 14, 2013
572013
WebDocs: a real-life huge transactional dataset.
C Lucchese, S Orlando, R Perego, F Silvestri
FIMI 126, 2004
572004
Mining query logs to optimize index partitioning in parallel web search engines
C Lucchese, S Orlando, R Perego, F Silvestri
Proceedings of the 2nd international conference on Scalable information …, 2007
552007
Assigning document identifiers to enhance compressibility of web search engines indexes
F Silvestri, R Perego, S Orlando
Proceedings of the 2004 ACM symposium on Applied computing, 600-605, 2004
542004
The system can't perform the operation now. Try again later.
Articles 1–20