@article {296,
	title = {Application-level solution for data integration in ubiquitous computing environment},
	journal = {Journal of Digital Information Management},
	volume = {9},
	year = {2011},
	note = {Export Date: 10 July 2014},
	month = {2011},
	pages = {233 - 241},
	abstract = {The Ubiquitous Computing envisions a world of communicating mobile devices and sensors. Advances in wireless communications raise users{\textquoteright} expectations about the accessibility of information in Ubiquitous Computing environments. Getting meaningful information from disparate sensor nodes and/or mobile devices spread in Ubiquitous Computing environment is an urgent task. On the one hand, the heterogeneity of the sensor nodes makes share and finding data at the mobile devices and sink nodes much harder. On the other hand, nodes in Ubiquitous Computing environment are highly dynamic which means query planning in Ubiquitous Computing environment should be able to dynamically re-make their plan when the network conditions change due to intermittent connectivity. To address these two issues, this paper proposes a new service-oriented framework(called UCDS, standing for Ubiquitous Computing Data Services ) at application-level, which supports for semantic integration and querying of heterogeneous data sets distributed over the Ubiquitous Computing environment. We propose a RDF-View-based approach for mobile data mediation, and describe the service-composition-based query planning algorithm implemented in UCDS. We explore an ontology based approach to, mapping mobile data to data services (DS for short), publishing DS with the shared domain ontology. We also explore dynamically evolving service interface enabled by richly service description capability using the semantic web languages, and answering queries through DS composition. Experimental results show that the approach adopted by UCDS provides a better performance compared with the conventional approach.},
	keywords = {Data integration, Query processing, Service composition, Ubiquitous Computing Data Services},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855403966\&partnerID=40\&md5=c0fbe9d31dec46666f6361a5d9fb7a72},
	author = {Zhou, L. and Zhang, Y. and Guan, B.}
}
@article {288,
	title = {Querying and ranking xml documents based on data synopses},
	journal = {Journal of Digital Information Management},
	volume = {9},
	year = {2011},
	note = {Export Date: 10 July 2014},
	month = {2011},
	pages = {199 - 205},
	abstract = {There is an increasing interest in recent years for querying and ranking XML documents. In this paper, we present a new framework for querying and ranking schema-less XML documents based on concise summaries of their structural and textual content. We introduce a novel data synopsis structure to summarize the textual content of an XML document for efficient indexing. More importantly, we extend the traditional vector space model to effectively rank XML documents over the proposed data synopses. We conduct extensive experiments over XML benchmark data to demonstrate the advantages of the indexing scheme and the effectiveness of our ranking scheme. We also compare our framework with Lucene to demonstrate our extended TF*IDF scoring function is effective.},
	keywords = {Document ranking, Query processing, Query synopses, XML},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855362331\&partnerID=40\&md5=85a8a3de60a877da1d0a3495eaf27e22},
	author = {He, W. and Lv, T.}
}
@article {163,
	title = {Complex query processing on Web graph: A social network perspective},
	journal = {Journal of Digital Information Management},
	volume = {6},
	year = {2008},
	note = {Cited By (since 1996):2Export Date: 10 July 2014},
	month = {2008},
	pages = {12 - 20},
	abstract = {A social network represents a social community as a directed graph. Communication on the Web has given rise to social network formation like, Web Community, Referral System etc. An earlier effort has proposed a data model for such Web-based social network. Present paper discusses the relevant index structures for processing queries on a social network schema based upon the proposed data model. The paper has also provided evaluation of the structural operators proposed in the data model and discussed their efficacy with query examples.},
	keywords = {Operator Evaluation, Query processing, Social Network, Web Graph, XB-tree},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849104350\&partnerID=40\&md5=3a2ecc369cf5c3b535859eeb8d73c2e0},
	author = {Mitra, S. and Bagchi, A. and Bandyopadhyay, A.K.}
}
@article {145,
	title = {Query planning in the PORDaS P2P database system},
	journal = {Journal of Digital Information Management},
	volume = {6},
	year = {2008},
	note = {Export Date: 10 July 2014},
	month = {2008},
	pages = {307 - 314},
	abstract = {Computational science is a rapidly growing multidisciplinary field that has a need for scalable, distributed, and efficient data management. In our research, we see the peer-to-peer (P2P) paradigm a possible solution to some of the problems in distributed data management. P2P has already proved to be suitable in contexts like file sharing, distributed computations, and distributed search. In our research we are aiming at using P2P to solve some problems in the domain of distributed databases. In this paper we 1) present PORDaS, a distributed DBMS based on P2P techniques, 2) describe query processing and query planning in PORDaS, and 3) present results from an experimental evaluation of different query planning variants.},
	keywords = {Data grid, Distributed databases, Peer-to-peer, Query processing},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349991902\&partnerID=40\&md5=ac29e0f628f2878d089fa8c43f3eb0de},
	author = {N{\o}rv{\r a}g, K. and Eide, E. and Standal, O.H.}
}
@article {73,
	title = {An efficient path query processing support for parent-child relationship in native XML databases},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Cited By (since 1996):4Export Date: 10 July 2014},
	month = {2007},
	pages = {82 - 87},
	abstract = {Due to its flexibility and efficiency in transmission of data, XML has become the emerging standard for data transfer and exchange across the Internet. In native XML database, XML documents are usually modeled as trees, and XML queries are typically specified in path expression. The primitive structural relationships are parent-child and ancestor-descendant in the path expression. Thus, finding all occurrences of these relationships is crucial. We adopt the decomposition-matching-merging approach and propose INLAB a novel hybrid query processing merging both indexing and labeling technologies, Experimental results show that INLAB can process XML path queries by up to an order of magnitude faster than conventional top-down approach.},
	keywords = {Matching, Path expression, Path query, Query evaluation, Query pattern, Query processing, XML},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-36048941577\&partnerID=40\&md5=7e045de46c15618285abdf54053caa5f},
	author = {Haw, S.-C. and Rao, G.S.V.R.K.}
}
@article {107,
	title = {A multilingual query processing system using software agents},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Export Date: 10 July 2014},
	month = {2007},
	pages = {385 - 390},
	abstract = {The goal of this work was developing a query processing system using software agents. Open Agent Architecture framework is used for system development. The system supports queries in both Hindi and Malayalam; two prominent regional languages of India. Natural language processing techniques are used for meaning extraction from the plain quety and information from database is given back to the user in his native language. The system architecture is designed in a structured way that it can be adapted to other regional languages of India. This system can be effectively used in application areas like e-governance, agriculture, rural health, education, nabonal resource planning, disaster management, information kiosks etc where people from all walks of life are involved.},
	keywords = {Database design, Interfaces, Query processing, Software agents},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149103443\&partnerID=40\&md5=a0ff33f2cca96dffadef4c9797934125},
	author = {Idicula, S.M. and David Peter, S.}
}
@article {83,
	title = {Stack-based pattern matching algorithm for XML query processing},
	journal = {Journal of Digital Information Management},
	volume = {5},
	year = {2007},
	note = {Cited By (since 1996):4Export Date: 10 July 2014},
	month = {2007},
	pages = {167 - 174},
	abstract = {With the popularity of XML as data exchange over the Web, querying XML data has become an important issue to be addressed. Since the logical structure of XML is a tree, establishing a parent-child (P-C), ancestor-descendant (A-D) or sibling relationship between nodes is essential for structural query processing. Thus, we propose using a < self-level: parent> labeling scheme to encode each element in the XML database by its positional information. Based on this labeling scheme, we further propose our TwigINLAB algorithm to optimize the query processing. Experimental results indicate that TwigINLAB can process both path queries and twig queries better than the TwigStack algorithm on an average of 27\% and 14\% respectively in terms of execution time using the XMARK benchmark dataset.},
	keywords = {Labeling, Pattern matching, Query processing, Structural query, Twig query, XML},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-63149191050\&partnerID=40\&md5=a28a66080f0d1b4d84de686811194d9f},
	author = {Haw, S.-C. and Lee, C.-S.}
}
@article {27,
	title = {Continuously evaluating approximate similarity search on high dimensional data stream},
	journal = {Journal of Digital Information Management},
	volume = {4},
	year = {2006},
	note = {Export Date: 10 July 2014},
	month = {2006},
	pages = {82 - 86},
	abstract = {In many applications, including online video monitoring system, it is often necessary to find out the most similar sequence, from a sequence set in database, for the high dimensional data stream. Due to its high computation complexity and the restrictions of query processing on data stream, continuously retrieving the similar content on high dimensional data stream is very challenging. The evaluating algorithm is expected to be very fast to match data stream arrival rate. To address this problem, we propose a method called CVNN in this paper. In our method, the sequences in database are represented into the compact summaries, namely CVs, which can be stored in memory. An online algorithm is conducted to transform data stream into a small number of CVs continuously, at the same time the nearest neighbor query is processed periodically based on the similarity of CVs. Experimental results show that our method is fairly effective.},
	keywords = {Data stream, High dimensional space, Query processing, Similarity Search, Video indexing},
	url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748267270\&partnerID=40\&md5=da6323dddf161caf008918184cbec115},
	author = {Wang, W. and Li, J. and Ai, C. and Shi, S.}
}
