SOA enables business processes (BPs) to be available in form of service. In today world, BP involves human social interactions as part of the business requirements. These interactions are performed through corporate tools running inside the organization called "Enterprise Social Networking" (ESN). Business and IT people depend on these tools to reshape the organization BPs as services. However, most of these tools are monolithic packages, where business and IT people cannot utilize embedded data. In this paper, we define an approach to reengineer the ESN and extract new social-web services that are loosely coupled, discoverable and reusable by other SOA application. This will enable organizations to provide social BPs as services to facilitate partners and customers' collaboration and participation without replacing their legacy applications. This approach will be evaluated by a use case and in future by a prototype simulation.

In this article, we discuss the issues involved in adding a native score management system to object-relational databases, to be used in querying Web metadata (that describes the semantic content of Web resources). The Web metadata model is based on topics (representing entities), relationships among topics (called metalinks ), and importance scores (sideway values) of topics and metalinks. We extend database relations with scoring functions and importance scores. We add to SQL score-management clauses with well-defined semantics, and propose the sideway-value algebra (SVA), to evaluate the extended SQL queries. SQL extensions and the SVA algebra are illustrated through two Web resources, namely, the DBLP Bibliography and the SIGMOD Anthology.SQL extensions include clauses for propagating input tuple importance scores to output tuples during query processing, clauses that specify query stopping conditions, threshold predicates (a type of approximate similarity predicates for text comparisons), and user-defined-function-based predicates. The propagated importance scores are then used to rank and return a small number of output tuples. The query stopping conditions are propagated to SVA operators during query processing. We show that our SQL extensions are well-defined, meaning that, given a database and a query Q, under any query processing scheme, the output tuples of Q and their importance scores stay the same.To process the SQL extensions, we discuss two sideway value algebra operators, namely, sideway value algebra join and topic closure, give their implementation algorithms, and report their experimental evaluations.