The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The following topics are dealt with: XML; multimedia data mining and management; visual data analysis; multimedia indexing; evolutionary technique; knowledge management and discovery; ubiquitous context-aware and pervasive application; text-based information retrieval; software engineering; multimedia semantic Web and annotation; decision support system; structural health monitoring; flexible query...
This paper proposes a novel approach for querying large-scale XML data using PC cluster system. With the recent spread of the XML format, large-scale data coded in XML ranging from several hundreds of megabytes to several gigabytes has become common. However, XML databases are often innefficient in dealing with huge XML data. The problem is the complexity of the XML data model and query processing...
Functional dependencies (FDs) are an integral part of relational database theory since they are used in integrity enforcement and in database design. Despite their importance FDs are often not specified or some of them are not expected by database designers, but they occur in the data and the need of inferring them from data arises. Furthermore, in several areas as data cleaning, data integration...
A key issue in exchanging XML-based data is their transformation. However, available transformation languages are generally still low-level. Their low-level transformation operators do not reflect the target language concepts and terminologies. Moreover, transformation correctness is usually beyond the scope of such operators. This paper presents a generic framework which offers higher-level transformation...
Due to the lack of efficient native XML database management systems, XML data manipulation and query evaluation may be resource-consuming, and represent a bottleneck for several computationally intensive applications. To overcome the above limitations, a possible solution consists in computing synopsis data structures from XML databases, i.e. compressed representations providing a "succinct"...
In this paper, we describe a translation algorithm that maps spatio-temporal conceptual schemas into XML schemas expressed in the W3C XML Schema Language. Moreover, we extend the standard XML Schema validator with a Java library to check spatio-temporal constraints. The resulting framework allows one to validate XML documents containing spatio-temporal information with respect to spatio-temporal conceptual...
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel optimisation technique for XML queries that is based on the semantic properties exhibited by XML data. In sharp contrast to previous studies on selectivity estimation we propose to specify bounds on the number of element nodes...
We present an approach for controlling the freshness of replicated XML documents. The main idea is that read-only transactions may accept to read stale data, provided they can express an upper bound on the staleness of the data they read. Controlling the freshness of data accessed by read-only transactions greatly improves load balancing since it allows for choosing a node for executing the transaction...
Various kinds of data such as news articles and sensor data are generated continuously in the form of XML data on the network. The processing systems (e.g., systems for selective dissemination of information and notification) must evaluate many filters for every XML data. Therefore, Gupta and Suciu proposed an automaton called the XPush machine, which can efficiently evaluate a large number of XPath...
In this work, we focus on two aspects of the comparison of video shots. We present a new approach to extract a variable number of key frames from a shot, by the use of a hierarchical clustering with automatic level selection, in order to provide optimal allocation of features on different parts of the shot. We then employ the Mallows distance as an effective technique to compare the discrete distributions...
In this paper, we examine the application of manifold learning to the clustering problem. The method used is Locality Preserving Projections (LPP), which is chosen because of its computational efficiency. A detailed derivation of the method is presented, as well as the theoretical justification behind it. Experiments performed on CMU's PIE database show that the projections created by LPP yield better...
Automatic semantic propagation is an important technique to complete the image retrieval process which is provided to increase accuracy, speed and performance of image retrieval systems and also to decrease human expenses. In this paper, an automatic approach to propagate the semantics in the image data base is presented. The proposed approach provides a suitable framework for semantic propagation...
Both geographic information systems and information retrieval have been very active research fields in the last decades. Lately, a new research field called geographic information retrieval has appeared from the intersection of these two fields. The main goal of this field is to define index structures and techniques to efficiently store and retrieve documents using both the text and the geographic...
The development of applications that manage large text collections needs indexing methods which allow efficient retrieval over text. Several indexes have been proposed which try to reach a good trade-off between the space needed to store both the text and the index, and its search efficiency. Self-indexes are becoming more and more popular. Not only they index the text, but they keep enough information...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.