Total views : 244

Search Ranking for Heterogeneous Data over Dataspace


  • Computer Science Department, Suresh Gyan Vihar University, Jaipur - 302017, Rajasthan, India
  • Computer Network Engineering Department, King Khalid University, Saudi Arabia


Traditional relational database systems queries works over structured data, whereas information retrieval systems are designed for additional versatile and flexible ranked keyword queries, works over unstructured data, Semi-structured, Streamed data, Social networking data and data without any format, known as heterogeneous data. However, several new and emerging applications need data management capabilities that mix the advantages both approaches. In this paper, we have proposed and initiate steps to combine heterogeneous statistics and information retrieval systems over Dataspace, which are the collection heterogeneous data, data from various sources and in different format. In several enterprise, the heterogeneity among information at different levels has becomes a difficult job. In an organization, data exist in structured, semi-structured or unstructured format or combination of all these. The existing heterogeneous data management systems are unsuccessful to deal with such information in efficient manner. Dataspace approach gives the solution of the problem of presence of heterogeneity in information and a variety of drawbacks of the existing systems. The main motive of this paper is to explain searching ranking mechanism in Dataspace. We also investigate how structured, semi structured or unstructured data can be take advantages for ranking of search on Web and Dataspace with their research challenges.


Algorithms, Dataspace, Information Retrieval, Internet of Thing, Ranking, Ranking of Database, Search Engines Algorithms.

Full Text:

 |  (PDF views: 286)


  • Franklin M, Halevy A, Maier D. From databases to dataspaces: A new abstraction for information management. ACM Sigmod Record. 2005; 34(4):27–33.
  • Podolecheva M, Prof T, Scholl M, Holupirek E. Principles of Dataspaces. Seminar From Databases to Dataspaces Summer Term; 2007.
  • Daniel MH. Ranking for web data search using on-the-fly data integration. KIT scientific publishing; 2014.
  • Chen Y, Wang W, Liu Z, Lin X. Keyword search on structured and semi-structured data. In Proceedings of the 2009 ACM SIGMOD International Conference on Management of data; 2009. p. 1005–10.
  • Cleverdon C. The cranfield tests on index language devices. In Aslib Proceedings. 1967; 19(6):173–94.
  • Pound J, Mika, Zaragoza H. Ad-hoc object retrieval in the web of data. In Proceedings of the 19th International Conference on World Wide Web. 2010. p. 771–80.
  • Weikum G. DB&IR;: Both sides now. In Proceedings of ACM SIGMOD International Conference on Management of Data; 2007. p. 25–30.
  • Robertson S, Zaragoza H. The probabilistic relevance framework: BM25 and beyond. 2010; 3(4):333–89.
  • Zhao L, Callan J. Effective and efficient structured retrieval. Proceedings of the 18th ACM Conference on Information and Knowledge Management. 2009. p. 1573–6.
  • Kleinberg JM. Authoritative sources in a hyperlinked environment. JACM. 1999; 46(5):604–32.
  • Brin S, Page L. The anatomy of a large-scale hypertextual web search engine. Computer Networks. 2012; 56(18):3825–33.
  • Harth A, Kinsella S, Decker S. Using naming authority to rank data and ontologies for web search. International Semantic Web Conference; Berlin Heidelberg: Springer. 2009 Oct. p. 277–92.
  • Delbru R, Toupikov N, Catasta M, Tummarello G, Decker S. Hierarchical link analysis for ranking web data. Extended Semantic Web Conference; Berlin Heidelberg: Springer. 2010. p. 225–39.
  • Lalmas M. XML retrieval (synthesis lectures on information concepts, retrieval, and services). San Francisco: Morgan and Claypool Publishers; 2009.
  • Chaudhuri S, Das G, Hristidis V, Weikum G. Probabilistic ranking of database query results. Proceedings of the 13th International Conference on Very Large Data Bases. 2004; 30:888–99.
  • Rocha C, Schwabe D, Aragao MP. A hybrid approach for searching in the semantic web. In Proceedings of the 13th International Conference on World Wide Web; 2004. p. 374–83.
  • Bhagdev, R, Chapman S, Ciravegna F, Lanfranchi V, Petrelli D. Hybrid search: Effectively combining keywords and semantic searches. European Semantic Web Conference; 2008. p. 554–68.
  • Elbassuoni S, Ramanath M, Schenkel R, Sydow M, Weikum G. Language-model-based ranking for queries on RDF-graphs. Proceedings of the 18th ACM conference on Information and Knowledge Management; ACM. 2009. p. 977–86.
  • Singh M, Jain SK. Transformation rules for decomposing heterogeneous data into triples. Journal of King Saud University-Computer and Information Sciences. 2015; 27(2):181–92.
  • Doan A, Halevy AY. Semantic integration research in the database community: A brief survey. AI Magazine. 2005 Mar; 26(1):83–94.
  • Lal N, Qamar S. Comparison of ranking algorithm with dataspace. Proceeding of International Conference on Advances in Computer Engineering and Application (ICACEA); 2015 Mar; p. 565–72.
  • Dwivedi S, Shiwani S. Evaluation of bitmap index compression using data pump in oracle data base. IOSR-JCE. 2014 May/Jun: 16(3):43–8. e-ISSN: 2278-0661, p- ISSN: 2278-8727


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.