Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Results diversification for keyword search on XML documents has attracted considerable attentions from research community in recent years. Though search results were diversified from different perspectives in the existing methods, the effects were still far away from satisfactory. This paper proposes a new way to
In this paper, we focus on efficient keyword query processing for XML data based on the SLCA and ELCA semantics. We propose a novel form of inverted lists for keywords which include IDs of nodes that directly or indirectly contain a given keyword. We propose a family of efficient algorithms that are based on the set
In the research field of XML retrieval with keyword-based approach, a variant of Lowest Common Ancestors (LCAs) have been widely accepted to provide how keywords are connected by ancestor relationship. However, returning a whole subtree or a partial subtree based on LCA nodes is insufficient for identifying how
Meaningful and useful return information is extraordinary important for information retrieval and XML keyword search. In this work, based on analysis the structure of XML document, we propose an algorithm to classify return matched nodes, we present formal analysis on LCA (lowest common ancestor) nodes ranking and LCA
Recently, a great deal of attention has been focusing on processing keyword search over static and XML streams. Keyword search is becoming more popular for its simplicity and its user-friendliness in querying XML databases. However, it is hard to express real search intention with just keyword search. There are many
Recently, keyword search has attracted a great deal of attention in an XML database. In many applications which backend data source powered by an XML database management system, keyword search because important to query XML data if the user does not know the structure or only knows the structure of XML partially
There may exist a specific relationship between the keywords if an XML multi-keywords search has more than one answers. Such relationship can be speculated by SLCA. This paper proposes a user-friendly Top-k keywords searching approach based on the relationship of keywords. The SLCA of a keyword search is first
keywords query and the common structure information of XML datasets. We can evaluate the generated structured queries over the XML data sources with any existing structure search engine.
Labeling schemes play crucial roles in the processing of XML queries. Designing labeling scheme that can support various common structural relationship queries (such as PC, AD, SR, DO, and LCA) among nodes, has received much research attention. Although there have existed a variety of labeling schemes such as prefix-based labeling, interval-based labeling and integer-based labeling and as well as...
Many companies and organizations, especially governmental agencies have been classifying their documents according to strictly controlled security levels. In this paper, we present security technologies enabling to convert security levels of the secure documents between different security domains. If a higher security level document should be converted to a lower security level document for being...
databases are termed as Web Databases (WDB). Web databases have been frequently employed to search the products online for retail industry. They can be private to a retailer/concern or publicly used by a number of retailers. Whenever the user queries these databases using keywords, most of the times the user will be deviated
In the age of Internet, with the online information explosive growth, people want to find information we need in the cyberworld fleetly and exactly. The information retrieval method based on the keyword or the simple logic-combination of the keywords has been unable to meet the people's need of information getting to
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.