Data processing: database and file management or data structures – Database and file access – Query optimization
Reexamination Certificate
2011-08-02
2011-08-02
Mofiz, Apu M (Department: 2161)
Data processing: database and file management or data structures
Database and file access
Query optimization
C707S713000, C707S722000
Reexamination Certificate
active
07991769
ABSTRACT:
An improved system and method is provided for searching a collection of objects that may be located in hierarchies of auxiliary information for retrieval of response objects. A framework to perform a generalization search in hierarchies may be used to generalize a search by moving up to a higher level in a hierarchy of taxonomies or to specialize a search by moving down to a lower level in the hierarchy of taxonomies. Once the system may decide to enumerate response objects at a particular level of generalization, a budgeted generalization search may be used for enumerating a set of response objects within a budgeted cost.
REFERENCES:
patent: 5924090 (1999-07-01), Krellenstein
patent: 6928445 (2005-08-01), Agrawal et al.
patent: 7107264 (2006-09-01), Lu
patent: 7117207 (2006-10-01), Kerschberg et al.
patent: 7181438 (2007-02-01), Szabo
patent: 2004/0186827 (2004-09-01), Anick et al.
patent: 2004/0243632 (2004-12-01), Beyer et al.
patent: 2006/0173873 (2006-08-01), Prompt et al.
patent: 2007/0005622 (2007-01-01), Fernandes et al.
R. Agrawal, A. Gupta, and S. Sarawagi. Modeling multidimensional databases. InProc. 13th ICDE, pp. 232-243, 1997.
S. Agrawal, S. Chaudhuri, and G. Das. DBXplorer: A system for keyword-based search over relational databases. InProc. 18th ICDE, pp. 5-16. 2002.
R. Baeza-Yates and B. Ribeiro-Neto.Modern Information Retrieval. Addison Wesley. 1999.
Y. Bartal. On approximating arbitrary metrics by tree metrics. InProc. 30th ACM STOC, pp. 161-168, 1998.
S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine.WWW/Cornputer Networks, 30(1-7):107-117, 1998.
A. Z. Broder, D. Carmel, M. Herscovici, A. Soffer, and J. Y. Zien. Efficient query evaluation using a two-level retrieval process. InProc. 12th ACM CIKM, pp. 426-434, 2003.
H. Bronnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. InProc. 10th ACM SoCG, pp. 293-302, 1994.
D. Burdick, P. M. Deshpande, T. S. Jayram, R. Ramakrishnan, and S. Vaithyanathan. OLAP over uncertain arid imprecise data. InProc. 31st VLDB, pp. 970-981, 2005.
Y.-Y. Chen, T. Suel, and A. Markowetz. Efficient query processing in geographic web search engines. InProc. ACM SIGMOD, pp. 277-288, New York, NY, USA, 2006. ACM.
K. L. Clarkson and K. Varadarajan. Improved approximation algorithms for geometric set cover. InProc. 21st ACM SoCG, pp. 135-141, 2005.
W. F. Cody, J. T. Kreulen, V. Krishna. and W. S. Spangler. The integration of business intelligence and knowledge management.IBM Systems Journal, 41(4):697-713, 2002.
G. Cormode, F. Korn, S. Muthukrishnan, and D. Srivastava. Diamond in the rough: Finding hierarchical heavy hitters in multi-dimensional data. InProc. ACM SIGMOD, pp. 155-166, 2004.
R. Fagin, R. Guha, R. Kumar, J. Novak, D. Sivakumar, and A. Tomkins. Multi-structural databases. InProc. 24th PODS, pp. 184-195, 2005.
R. Fagin, P. Kolaitis, R. Kumar, J. Novak, D. Sivakumar, and A. Tomkins. Efficient implementation of large-scale multi-structural databases. InProc. 31st VLDB, pp. 958-969, 2005.
R. Fagin, A. Lotern, and M. Naor. Optimal aggregation algorithms for middleware.JCSS, 66(4):614-656, 2003.
D. Florescu, D. Kossmann, and I. Manolescu. Integrating keyword search into XML query processing.Computer Networks, 33(1-6):119-135, 2000.
M. Fontoura, V. Josifovski, E. Shekita, and B. Yang. Optimizing cursor movement in holistic twig joins. InProc. 14th ACM CIKM, pp. 784-791, 2005.
M. Fontoura, E. J. Shekita, J. Y. Zien, S. Rajagopalan, and A. Neumann. High performance index build algorithms for intranet search engines. InProc. 30th VLDB, pp. 1158-1169, 2004.
H. Garcia-Molina, J. Ullman, and J. Widom.Database System Implementation. Prentice Hall, 2000.
J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Fellow, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals.DMKD, 1(1)29-53, 1997.
D. Gruhl, L. Chavet, D. Gibson, J. Meyer, P. Pattanayak, A. Tomkins, and J. Y. Zien. How to build a WebFountain: An architecture for large-scale text analytics.IBM Systems Journal, 43(1):64-77, 2004.
S. Heinz and J. Zobel. Efficient single-pass index construction for text databases.JASIST. 54(8), 2003.
V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IR-style keyword search over relational databases. InProc. 29th VLDB, pp. 850-861, 2003.
H. V. Jagadish, L. S. Lakshmanan, and D. Srivastava. What can hierarchies do for data warehouses? InProc. 25th VLDB, pp. 530-541, 1999.
V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. InProc. 31st VLDB, pp. 505-516, 2005.
E. Kandogan, R. Krishnamurthy, S. Raghavan, S. Vaithyanathan, and H. Zhu. Avatar semantic search: A database approach to information retrieval. InProc. ACM SIGMOD, pp. 790-792, 2006.
D. Lewis, Y. Yang, T. Rose, and F. Li. RCV1: A new benchmark collection for text categorization research.JMLR, 5:361-397, 2004.
X. Long and T. Suel. Optimized query execution in large search engines with global page ordering. InProc. 29th VLDB. pp. 129-140, 2003.
S. Melnik, S. Raghavan, B. Yang, and H. Garcia-Molina. Building a distributed full-text index for the web. InProc. 10th WWW, pp. 396-406, 2001.
L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
H. Turtle and J. Flood. Query evaluation: strategies and optimizations.IPM, 31(6), 1995.
I. Witten, A. Moffat, and T. Bell.Managing Gigabytes. Morgan Kaufmann, 1999.
Y. Xu and Y. Papakonstantinou. Efficient keyword search for smallest LCAs in XML databases. InProc. ACM SIGMOD, pp. 537-538, 2005.
K.-P. Yee, K. Swearingen, K. Li, and M. Hearst. Faceted metadata for image search and browsing. InProc. ACM CHI, pp. 401-408, 2003.
X. Zhou, J. Gaugaz, W.-T. Balke, and W. Nejdl. Query relaxation using malleable schemas. InProc. ACM SIGMOD, pp. 545-556, 2007.
M. Fontoura, V. Josifovski, R. Kumar, C. Olston, A. Tomkins and S. Vassilvitskii. Relaxation in Text Search using Taxonomies,34thInternational Conference on Very Large Data Bases(VLDB 2008), 672-683, Auckland, New Zealand, 2008.
U.S. Appl. No. 11/483,047, filed Jul. 7, 2006, Office Action, Correspondence Mailing Date Mar. 16, 2010.
Fontoura Marcus Felipe
Josifovski Vanja
Olston Christopher
Ravikumar Shanmugasundaram
Tomkins Andrew
Buchenhorner Michael J.
Mofiz Apu M
Rahman Mohammad N
Yahoo ! Inc.
LandOfFree
System and method for budgeted generalization search in... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for budgeted generalization search in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for budgeted generalization search in... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2662741