We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatical...
Theabilitytointelligentlycollect,manageandanalyzeinformationaboutcustomersandsellersisakeysourceofcompetitive advantage for an e-business. This ability provides an opportunity to ...
Atta Ebrahim E. ElAlfi, R. Haque, M. Esmel ElAlami
The efficient execution of integration processes between distributed, heterogeneous data sources and applications is a challenging research area of data management. These inn proc...
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...