• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 11 - 20 of 82
Next 10 →

Efficient Query Optimizing System for Searching Using Data Mining Technique

by unknown authors
"... There is a critical need to design and develop tools that abstract away the fundamental complexity of XML based Web services specifications and toolkits, and provide an elegant, intuitive, simple, and powerful query based invocation system to end users. Web services based tools and standards have be ..."
Abstract - Add to MetaCart
There is a critical need to design and develop tools that abstract away the fundamental complexity of XML based Web services specifications and toolkits, and provide an elegant, intuitive, simple, and powerful query based invocation system to end users. Web services based tools and standards have

Join-Based Algorithms for Keyword Search in XML Databases

by Liang Chen, Yannis Papakonstantinou
"... We consider the problem of keyword search in XML databases under the excluding lowest common ancestor (ELCA) semantics. Our analysis shows that ELCA semantics may lead to conflict with keyword proximity concept, and under such semantics, lower ELCAs are preferable because lower elements tend to be m ..."
Abstract - Add to MetaCart
We consider the problem of keyword search in XML databases under the excluding lowest common ancestor (ELCA) semantics. Our analysis shows that ELCA semantics may lead to conflict with keyword proximity concept, and under such semantics, lower ELCAs are preferable because lower elements tend

On the Size of Full Element-Indexes for XML Keyword Search

by Duygu Atilgan, Ismail Sengor Altingovde, Özgür Ulusoy
"... Abstract. We show that a full element-index can be as space-efficient as a direct index with Dewey ids, after compression using typical techniques. 1 Full Element-Index for XML Keyword Search Keyword search is a crucial operation that has to be supported on XML data. Earlier works attacking this pro ..."
Abstract - Add to MetaCart
Abstract. We show that a full element-index can be as space-efficient as a direct index with Dewey ids, after compression using typical techniques. 1 Full Element-Index for XML Keyword Search Keyword search is a crucial operation that has to be supported on XML data. Earlier works attacking

Personalized Keyword Search with Partial-Order Preferences

by Achim Leubner, Werner Kießling - IN PROC. OF BRAZILIAN SYMP. ON DATABASES (SBBD’02) , 2002
"... Personalized search engines must be able to cope with various user preferences, retrieving the best matches to a query. For SQL and XML applications new methods for such preference-based searches have been implemented recently. Here we adopt this approach to keyword search in full-text search engine ..."
Abstract - Cited by 8 (2 self) - Add to MetaCart
Personalized search engines must be able to cope with various user preferences, retrieving the best matches to a query. For SQL and XML applications new methods for such preference-based searches have been implemented recently. Here we adopt this approach to keyword search in full-text search

Object/relational query optimization with chase

by Lucian Popa
"... and backchase ..."
Abstract - Add to MetaCart
and backchase

Evaluation of Top-k Queries over Structured and Semi-structured Data

by Amélie Marian , 2005
"... Traditionally, queries over structured (e.g., relational) and semi-structured (e.g., XML) data identify the exact matches for the queries. This exact-match query model is not appropriate for many database applications and scenarios where queries are inherently fuzzy —often expressing user preference ..."
Abstract - Add to MetaCart
Traditionally, queries over structured (e.g., relational) and semi-structured (e.g., XML) data identify the exact matches for the queries. This exact-match query model is not appropriate for many database applications and scenarios where queries are inherently fuzzy —often expressing user

A Partition-Based Approach for XPath Testing

by Claudio De La Riva, José García-fanjul, Javier Tuya - Proceedings of the International Conference on Software Engineering Advances , 2006
"... Abstract—The XML language is becoming the preferred means of data interchange and representation in web based applications. Usually, XML data is stored in XML repositories, which can be accessed efficiently using the standard XPath as query language. However, the specific techniques for testing thes ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
Abstract—The XML language is becoming the preferred means of data interchange and representation in web based applications. Usually, XML data is stored in XML repositories, which can be accessed efficiently using the standard XPath as query language. However, the specific techniques for testing

Efficient Management of Data Center Resources for Massively Multiplayer

by Online Games, Vlad Nae, Ru Iosup, Stefan Podlipnig, Radu Prodan, Dick Epema, Thomas Fahringer, Multiplayer Online Games
"... (MMOGs) can include millions of concurrent players spread across the world. To keep these highly-interactive virtual environments online, a MMOG operator may need to provision tens of thousands of computing resources from various data centers. Faced with large resource demand variability, and with m ..."
Abstract - Add to MetaCart
of both the player population and the player interactions. We evaluate several algorithms, including a novel neural network predictor, for predicting the resource demand. Using trace-based simulation, we evaluate the impact of the data center policies on the resource provisioning efficiency; we show

XQuery Imp lementation in a Relational Database Syst em

by Shankar Pal Istvan, Shankar Pal, Istvan Cseri, Oliver Seeliger, Michael Rys, Gideon Schaller, Wei Yu, Dragan Tomic, Adrian Baras - In VLDB 2005 , 2005
"... Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the data into a large number of tables and the cost of reassembling the XML data. The upcoming release of Microsoft's SQL S ..."
Abstract - Add to MetaCart
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the data into a large number of tables and the cost of reassembling the XML data. The upcoming release of Microsoft's SQL

Verification of tree updates for optimization

by Michael Benedikt, Angela Bonifati, Sergio Flesca, Avinash Vyas - IN: CAV , 2005
"... With the rise of XML as a standard format for representing treeshaped data, new programming tools have emerged for specifying transformations to tree-like structures. A recent example along this line are the update languages of [17, 16, 9] which add tree update primitives on top of the declarative ..."
Abstract - Cited by 13 (5 self) - Add to MetaCart
query languages XPath and XQuery. These tree update languages use a “snapshot semantics”, in which all querying is performed first, after which a generated sequence of concrete updates is performed in a fixed order determined by query evaluation. In order to gain efficiency, one would prefer to perform
Next 10 →
Results 11 - 20 of 82
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University